Accurate and Fast Proximity Queries Between Polyhedra Using Convex Surface Decomposition
No Thumbnail Available
Date
2001
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Blackwell Publishers Ltd and the Eurographics Association
Abstract
The need to perform fast and accurate proximity queries arises frequently in physically-based modeling, simulation, animation, real-time interaction within a virtual environment, and game dynamics. The set of proximity queries include intersection detection, tolerance verification, exact and approximate minimum distance computation, and (disjoint) contact determination. Specialized data structures and algorithms have often been designed to perform each type of query separately. We present a unified approach to perform any of these queries seamlessly for general, rigid polyhedral objects with boundary representations which are orientable 2-manifolds. The proposed method involves a hierarchical data structure built upon a surface decomposition of the models. Furthermore, the incremental query algorithm takes advantage of coherence between successive frames. It has been applied to complex benchmarks and compares very favorably with earlier algorithms and systems.
Description
@article{10.1111:1467-8659.00543,
journal = {Computer Graphics Forum},
title = {{Accurate and Fast Proximity Queries Between Polyhedra Using Convex Surface Decomposition}},
author = {Ehmann, Stephen A. and Lin, Ming C.},
year = {2001},
publisher = {Blackwell Publishers Ltd and the Eurographics Association},
ISSN = {1467-8659},
DOI = {10.1111/1467-8659.00543}
}