Premium
Accurate and Fast Proximity Queries Between Polyhedra Using Convex Surface Decomposition
Author(s) -
Ehmann Stephen A.,
Lin Ming C.
Publication year - 2001
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/1467-8659.00543
Subject(s) - polyhedron , computer science , disjoint sets , intersection (aeronautics) , theoretical computer science , computation , set (abstract data type) , decomposition , algorithm , regular polygon , surface (topology) , data structure , mathematics , discrete mathematics , combinatorics , engineering , programming language , aerospace engineering , ecology , geometry , biology
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.