TY - JOUR
T1 - A real-time algorithm for accurate collision detection for deformable polyhedral objects
AU - Kitamura, Yoshifumi
AU - Smith, Andrew
AU - Takemura, Haruo
AU - Kishino, Fumio
PY - 1998/2
Y1 - 1998/2
N2 - We propose an accurate collision detection algorithm for use in virtual reality applications. The algorithm works for three-dimensional graphical environments where multiple objects, represented as polyhedra (boundary representation), are undergoing arbitrary motion (translation and rotation). The algorithm can be used directly for both convex and concave objects and objects can be deformed (nonrigid) during motion. The algorithm works efficiently by first reducing the number of face pairs that need to be checked accurately for interference, by first localizing possible collision regions using bounding box and spatial subdivision techniques. Face pairs that remain after this pruning stage are then accurately checked for interference. The algorithm is efficient, simple to implement, and does not require any memory-intensive auxiliary data structures to be precomputed and updated. The performance of the proposed algorithm is compared directly against other existing algorithms, e.g., the separating plane algorithm, octree update method, and distance-based method. Results are given to show the efficiency of the proposed method in a general environment.
AB - We propose an accurate collision detection algorithm for use in virtual reality applications. The algorithm works for three-dimensional graphical environments where multiple objects, represented as polyhedra (boundary representation), are undergoing arbitrary motion (translation and rotation). The algorithm can be used directly for both convex and concave objects and objects can be deformed (nonrigid) during motion. The algorithm works efficiently by first reducing the number of face pairs that need to be checked accurately for interference, by first localizing possible collision regions using bounding box and spatial subdivision techniques. Face pairs that remain after this pruning stage are then accurately checked for interference. The algorithm is efficient, simple to implement, and does not require any memory-intensive auxiliary data structures to be precomputed and updated. The performance of the proposed algorithm is compared directly against other existing algorithms, e.g., the separating plane algorithm, octree update method, and distance-based method. Results are given to show the efficiency of the proposed method in a general environment.
UR - http://www.scopus.com/inward/record.url?scp=0040428032&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0040428032&partnerID=8YFLogxK
U2 - 10.1162/105474698565514
DO - 10.1162/105474698565514
M3 - Article
AN - SCOPUS:0040428032
VL - 7
SP - 36
EP - 52
JO - Presence: Teleoperators and Virtual Environments
JF - Presence: Teleoperators and Virtual Environments
SN - 1054-7460
IS - 1
ER -