Details
| Original language | English |
|---|---|
| Pages (from-to) | 432-442 |
| Number of pages | 11 |
| Journal | Engineering Computations (Swansea, Wales) |
| Volume | 25 |
| Issue number | 5 |
| Publication status | Published - 18 Jul 2008 |
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
ASJC Scopus subject areas
- Computer Science(all)
- Software
- Engineering(all)
- Computer Science(all)
- Computer Science Applications
- Computer Science(all)
- Computational Theory and Mathematics
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
In: Engineering Computations (Swansea, Wales), Vol. 25, No. 5, 18.07.2008, p. 432-442.
Research output: Contribution to journal › Article › Research › peer review
}
TY - JOUR
T1 - A contact detection algorithm for superellipsoids based on the common-normal concept
AU - Wellmann, Christian
AU - Lillie, Claudia
AU - Wriggers, Peter
PY - 2008/7/18
Y1 - 2008/7/18
N2 - 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.
AB - 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.
KW - Computational geometry
KW - Motion
UR - http://www.scopus.com/inward/record.url?scp=48249117534&partnerID=8YFLogxK
U2 - 10.1108/02644400810881374
DO - 10.1108/02644400810881374
M3 - Article
AN - SCOPUS:48249117534
VL - 25
SP - 432
EP - 442
JO - Engineering Computations (Swansea, Wales)
JF - Engineering Computations (Swansea, Wales)
SN - 0264-4401
IS - 5
ER -