Exact Distance Computation for Deformable Objects
Type of publication: | Inproceedings |
Citation: | gissler08 |
Booktitle: | Proc. Computer Animation and Social Agents |
Year: | 2008 |
Abstract: | Abstract We present a novel approach for the computation of the minimum distance between arbitrarily shaped, triangulated objects. The approach proceeds in two stages. In the first stage, the Gilbert-Johnson-Keerthi algorithm (GJK) is performed. We show how to employ characteristics of the algorithm to efficiently compute lower and upper bounds of the minimum distance between non-convex objects. We further show how to use these bounds to set up a spatial subdivision scheme |
Userfields: | pdfurl={http://www.informatik.uni-bremen.de/agebv/downloads/published/gissler_casa_08.pdf}, project={A7-FreePerspective}, status={Reviewed}, |
Keywords: | distance computation GJK |
Authors | |
Attachments
|
|
Notes
|
|
|
|
Topics
|
|
|