Asset Details
Do you wish to reserve the book?
A contact detection algorithm for superellipsoids based on the common-normal concept
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
A contact detection algorithm for superellipsoids based on the common-normal concept
Do you wish to request the book?
A contact detection algorithm for superellipsoids based on the common-normal concept
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
A contact detection algorithm for superellipsoids based on the common-normal concept
2008
Overview
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.
Publisher
Emerald Group Publishing Limited
