DMCA
Efficient Collision Detection for Animation and Robotics (1993)
| Citations: | 124 - 17 self |
BibTeX
@TECHREPORT{Lin93efficientcollision,
author = {Ming C. Lin},
title = {Efficient Collision Detection for Animation and Robotics},
institution = {},
year = {1993}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We present efficient algorithms for collision detection and contact determination between geometric models, described by linear or curved boundaries, undergoing rigid motion. The heart of our collision detection algorithm is a simple and fast incremental method to compute the distance between two convex polyhedra. It utilizes convexity to establish some local applicability criteria for verifying the closest features. A preprocessing procedure is used to subdivide each feature's neighboring features to a constant size and thus guarantee expected constant running time for each test. The expected constant time performance is an attribute from exploiting the geometric coherence and locality. Let n be the total number of features, the expected run time is between O( p n) and O(n) ...
Keyphrases
efficient collision detection fast incremental method run time constant running time contact determination preprocessing procedure collision detection total number geometric model constant size curved boundary rigid motion local applicability criterion expected constant time performance convex polyhedron geometric coherence collision detection algorithm efficient algorithm
