Fast contact detection for ellipsoids using optimization approaches

Abstract: The paper is concerned with fast and robust contact detection methods for arbitrary ellipsoids. An iterative procedure, namely the Levenberg‐Marquardt method, based on the common normal concept for parametric ellipsoids, is employed together with an implementation of the widely used GJK algorithm for comparison. The performance and accuracy of both are analysed and compared to each other on the basis of two test sets, each containing a total of 70 000 pairs of prolates or oblates. Emphasis is placed on the specific error measure relating the iterative solution to the exact one, which was chosen to be the maximum angle between the normal vector and the distance vector between two ellipsoids. The results indicate increased performance when using the Levenberg‐Marquardt method over the GJK algorithm with no loss of accuracy.

Standort
Deutsche Nationalbibliothek Frankfurt am Main
Umfang
Online-Ressource
Sprache
Englisch

Erschienen in
Fast contact detection for ellipsoids using optimization approaches ; day:10 ; month:10 ; year:2023 ; extent:8
Proceedings in applied mathematics and mechanics ; (10.10.2023) (gesamt 8)

Urheber
Rebel, Ricardo
Fröhlich, Jochen

DOI
10.1002/pamm.202300268
URN
urn:nbn:de:101:1-2023101115300288637400
Rechteinformation
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
Letzte Aktualisierung
14.08.2025, 10:59 MESZ

Datenpartner

Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.

Beteiligte

  • Rebel, Ricardo
  • Fröhlich, Jochen

Ähnliche Objekte (12)