dc.identifier.uri |
http://dx.doi.org/10.15488/2714 |
|
dc.identifier.uri |
http://www.repo.uni-hannover.de/handle/123456789/2740 |
|
dc.contributor.author |
Wellmann, Christian
|
|
dc.contributor.author |
Lillie, Claudia
|
|
dc.contributor.author |
Wriggers, Peter
|
|
dc.date.accessioned |
2018-02-09T08:47:09Z |
|
dc.date.available |
2018-02-09T08:47:09Z |
|
dc.date.issued |
2008 |
|
dc.identifier.citation |
Wellmann, C.; Lillie, C.; Wriggers, P.: A contact detection algorithm for superellipsoids based on the common-normal concept. In: Engineering Computations (Swansea, Wales) 25 (2008), Nr. 5, S. 432-442. DOI: https://doi.org/10.1108/02644400810881374 |
|
dc.description.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. © Emerald Group Publishing Limited. |
eng |
dc.language.iso |
eng |
|
dc.publisher |
Bingley : Emerald Group Publishing Ltd. |
|
dc.relation.ispartofseries |
Engineering Computations (Swansea, Wales) 25 (2008), Nr. 5 |
|
dc.rights |
Es gilt deutsches Urheberrecht. Das Dokument darf zum eigenen Gebrauch kostenfrei genutzt, aber nicht im Internet bereitgestellt oder an Außenstehende weitergegeben werden. Dieser Beitrag ist aufgrund einer (DFG-geförderten) Allianz- bzw. Nationallizenz frei zugänglich. |
|
dc.subject |
Computational geometry |
eng |
dc.subject |
Motion |
eng |
dc.subject |
Algorithms |
eng |
dc.subject |
Newton-Raphson method |
eng |
dc.subject |
Optimization |
eng |
dc.subject |
Sheet metal |
eng |
dc.subject |
Signal detection |
eng |
dc.subject |
Contact detection |
eng |
dc.subject |
Contact detection algorithm |
eng |
dc.subject |
Contact points |
eng |
dc.subject |
Convergence (mathematics) |
eng |
dc.subject |
Design/methodology/approach |
eng |
dc.subject |
High accuracy |
eng |
dc.subject |
Iterative solutions |
eng |
dc.subject |
Levenberg-Marquardt methods |
eng |
dc.subject |
Newton's methods |
eng |
dc.subject |
Number of iterations |
eng |
dc.subject |
Surface normals |
eng |
dc.subject |
Surface points |
eng |
dc.subject |
Unconstrained optimization |
eng |
dc.subject |
Boolean functions |
eng |
dc.subject.ddc |
620 | Ingenieurwissenschaften und Maschinenbau
|
ger |
dc.title |
A contact detection algorithm for superellipsoids based on the common-normal concept |
eng |
dc.type |
Article |
|
dc.type |
Text |
|
dc.relation.issn |
0264-4401 |
|
dc.relation.doi |
https://doi.org/10.1108/02644400810881374 |
|
dc.bibliographicCitation.issue |
5 |
|
dc.bibliographicCitation.volume |
25 |
|
dc.bibliographicCitation.firstPage |
432 |
|
dc.bibliographicCitation.lastPage |
442 |
|
dc.description.version |
publishedVersion |
|
tib.accessRights |
frei zug�nglich |
|