• English
  • Deutsch
  • Log In
    Password Login
    Research Outputs
    Fundings & Projects
    Researchers
    Institutes
    Statistics
Repository logo
Fraunhofer-Gesellschaft
  1. Home
  2. Fraunhofer-Gesellschaft
  3. Konferenzschrift
  4. Rapid Collision Detection by Dynamically Aligned DOP-Trees
 
  • Details
  • Full
Options
1998
Conference Paper
Title

Rapid Collision Detection by Dynamically Aligned DOP-Trees

Abstract
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 re-aligning DOPs during traversal of such trees allows to use simple interval tests for determining 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 OBB-trees indicates that DOP-trees are efficient in terms of collision query time, and more efficient in memory usage and construction time.
Author(s)
Zachmann, G.
Fraunhofer-Institut für Graphische Datenverarbeitung IGD  
Mainwork
IEEE Virtual Reality Annual International Symposium 1998. Proceedings  
Conference
Virtual Reality International Symposium 1998  
DOI
10.1109/VRAIS.1998.658428
Language
English
Fraunhofer-Institut für Graphische Datenverarbeitung IGD  
Keyword(s)
  • hierarchical bounding volumes

  • Interference Detection

  • Physically-based Modeling

  • shape approximation

  • virtual prototyping

  • Cookie settings
  • Imprint
  • Privacy policy
  • Api
  • Contact
© 2024