By Topic

Rapid collision detection by dynamically aligned DOP-trees

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Zachmann, G. ; Fraunhofer Inst. for Comput Graphics, Darmstadt, Germany

Based on a general hierarchical data structure, we present a fast algorithm for exact collision detection of arbitrary polygonal rigid objects. Objects consisting of hundreds of thousands of polygons can be checked for collision at interactive rates. The pre-computed hierarchy is a tree of discrete oriented polytopes (DOPs). An efficient way of realigning DOPs during the traversal of such trees allows us to use simple interval tests for determining the overlap between DOPs. The data structure is very efficient in terms of memory and construction time. Extensive experiments with synthetic and real-world CAD data have been carried out to analyze the performance and memory usage of the data structure. A comparison with oriented bounding box (OBB) trees indicates that DOP-trees are as efficient in terms of collision query time and more efficient in memory usage and construction time.

Published in:

Virtual Reality Annual International Symposium, 1998. Proceedings., IEEE 1998

Date of Conference:

18-18 1998