A contact detection algorithm for superellipsoids based on the common-normal concept

authored by: Christian Wellmann, Claudia Lillie, Peter Wriggers
Abstract: Purpose - The paper aims to introduce an efficient contact detection algorithm for smooth convex particles. Design/methodology/approach - The contact points of adjacent particles are defined according to the common-normal concept. The problem of contact detection is formulated as 2D unconstrained optimization problem that is solved by a combination of Newton's method and a Levenberg-Marquardt method. Findings - The contact detection algorithm is efficient in terms of the number of iterations required to reach a high accuracy. In the case of non-penetrating particles, a penetration can be ruled out in the course of the iterative solution before convergence is reached. Research limitations/implications - The algorithm is only applicable to smooth convex particles, where a bijective relation between the surface points and the surface normals exists. Originality/value - By a new kind of formulation, the problem of contact detection between 3D particles can be reduced to a 2D unconstrained optimization problem. This formulation enables fast contact exclusions in the case of non-penetrating particles.
Organisation(s): Institute of Continuum Mechanics
Type: Article
Journal: Engineering Computations (Swansea, Wales)
Volume: 25
Pages: 432-442
No. of pages: 11
ISSN: 0264-4401
Publication date: 18.07.2008
Publication status: Published
Peer reviewed: Yes
ASJC Scopus subject areas: Software, Engineering(all), Computer Science Applications, Computational Theory and Mathematics
Electronic version(s): https://doi.org/10.1108/02644400810881374 (Access: Unknown)
: Details in the research portal "Research@Leibniz University"

BibTeX

@article{1af41a9088934bcfaa9a403497543a5a,
title = "A contact detection algorithm for superellipsoids based on the common-normal concept",
abstract = "Purpose - The paper aims to introduce an efficient contact detection algorithm for smooth convex particles. Design/methodology/approach - The contact points of adjacent particles are defined according to the common-normal concept. The problem of contact detection is formulated as 2D unconstrained optimization problem that is solved by a combination of Newton's method and a Levenberg-Marquardt method. Findings - The contact detection algorithm is efficient in terms of the number of iterations required to reach a high accuracy. In the case of non-penetrating particles, a penetration can be ruled out in the course of the iterative solution before convergence is reached. Research limitations/implications - The algorithm is only applicable to smooth convex particles, where a bijective relation between the surface points and the surface normals exists. Originality/value - By a new kind of formulation, the problem of contact detection between 3D particles can be reduced to a 2D unconstrained optimization problem. This formulation enables fast contact exclusions in the case of non-penetrating particles.",
keywords = "Computational geometry, Motion",
author = "Christian Wellmann and Claudia Lillie and Peter Wriggers",
year = "2008",
month = jul,
day = "18",
doi = "10.1108/02644400810881374",
language = "English",
volume = "25",
pages = "432--442",
journal = "Engineering Computations (Swansea, Wales)",
issn = "0264-4401",
publisher = "Emerald Group Publishing Ltd.",
number = "5",
}