Generalized penetration depth computation based on kinematical geometry

Georg Nawratil*, Helmut Pottmann, Bahram Ravani

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

19 Scopus citations

Abstract

The generalized penetration depth PD of two overlapping bodies X and Y is the distance between the given colliding position of X and the closest collision-free Euclidean copy Xε to X according to a distance metric. We present geometric optimization algorithms for the computation of PD with respect to an object-oriented metric S which takes the mass distribution of the moving body X into consideration. We use a kinematic mapping which maps rigid body displacements to points of a 6-dimensional manifold M6 in the 12-dimensional space R12 of affine mappings equipped with S. We formulate PD as the solution of the constrained minimization problem of finding the closest point on the boundary of the set of all points of M6 which correspond to colliding configurations. Based on the theory of gliding motions, the closest point with respect to the metric S (⇒ PDS) can be computed with an adapted projected gradient algorithm. We also present an algorithm for the computation of the closest point with respect to the geodesic metric G of M6 induced by S (⇒ PDG). Moreover we introduce two methods for the computation of a collision-free initial guess and give a physical interpretation of PDS and PDG.

Original languageEnglish (US)
Pages (from-to)425-443
Number of pages19
JournalComputer Aided Geometric Design
Volume26
Issue number4
DOIs
StatePublished - May 2009

Keywords

  • Distance function
  • Geometric optimization
  • Gliding motions
  • Kinematics
  • Penetration depth

ASJC Scopus subject areas

  • Modeling and Simulation
  • Automotive Engineering
  • Aerospace Engineering
  • Computer Graphics and Computer-Aided Design

Fingerprint

Dive into the research topics of 'Generalized penetration depth computation based on kinematical geometry'. Together they form a unique fingerprint.

Cite this