Penetration depth between two convex polyhedra: An efficient global optimization approach

Mark A. Abramson (mark.abramsonuvu.edu)
Griffin D. Kent (10764442my.uvu.edu)
Gavin W. Smith (gavin.w.smithintel.com)

Abstract: During the detailed design phase of an aerospace program, one of the most important consistency checks is to ensure that no two distinct objects occupy the same physical space. Since exact geometrical modeling is usually intractable, geometry models are discretized, which often introduces small interferences not present in the fully detailed model. In this paper, we focus on computing the depth of the interference, so that these false positive interferences can be removed, and attention can be properly focused on the actual design. Specifically, we focus on efficiently computing the penetration depth between two polyhedra, which is a well-studied problem in the computer graphics community. We formulate the problem as a constrained five-variable global optimization problem, and then derive an equivalent unconstrained, 2-variable nonsmooth problem. To solve the optimization problem, we apply a popular stochastic multistart optimization algorithm in a novel way, which exploits the advantages of each problem formulation simultaneously. Numerical results for the algorithm, applied to 14 randomly generated pairs of penetrating polytopes, illustrate both the effectiveness and efficiency of the method.

Keywords: Constrained optimization, global optimization, nonlinear optimization, penetration depth, geometric modelling

Category 1: Global Optimization (Applications )

Category 2: Applications -- Science and Engineering (Other )

Category 3: Nonlinear Optimization (Constrained Nonlinear Optimization )

Citation:

Download: [PDF]

Entry Submitted: 04/01/2021
Entry Accepted: 04/02/2021
Entry Last Modified: 04/02/2021

Modify/Update this entry