An Architecture for Hierarchical Collision Detection

Gabriel Zachmann and G. Knittel
In: Journal of WSCG, pages 149-156, Feb. 2003
Presented at WSCG 2003
 

Abstract

We present novel algorithms for efficient hierarchical collision detection and propose a hardware architecture for a single-chip accelerator. We use a hierarchy of bounding volumes defined by k-DOPs for maximum performance. A new hierarchy traversal algorithm and an optimized triangle-triangle intersection test reduce bandwidth and computation costs. The resulting hardware architecture can process two object hierarchies and identify intersecting triangles autonomously at high speed. Real-time collision detection of complex objects at rates required by force-feedback and physically-based simulations can be achieved.

Download Paper

Download Paper

Bibtex

@INCOLLECTION{zachmann-2003-architecture,
      author = {Zachmann, Gabriel and Knittel, G.},
       pages = {149--156},
       title = {An Architecture for Hierarchical Collision Detection},
   booktitle = {Journal of WSCG},
      volume = {11},
      number = {1},
        year = {2003},
       month = feb,
    abstract = {We present novel algorithms for efficient hierarchical collision detection and propose a hardware
                architecture for a single-chip accelerator. We use a hierarchy of bounding volumes defined by k-DOPs
                for maximum performance. A new hierarchy traversal algorithm and an optimized triangle-triangle
                intersection test reduce bandwidth and computation costs. The resulting hardware architecture can
                process two object hierarchies and identify intersecting triangles autonomously at high speed.
                Real-time collision detection of complex objects at rates required by force-feedback and
                physically-based simulations can be achieved.},
        issn = {1213-6972},
  conference = {WSCG 2003}
}