OBB-Tree: A hierarchical structure for rapid interference detection

DMCA

OBB-Tree: A hierarchical structure for rapid interference detection (1996)

Cached

Download Links

by S. Gottschalk , M. C. Lint , D. Manocha

Venue:	PROC. ACM SIGGRAPH, 171–180
Citations:	844 - 53 self

BibTeX

@INPROCEEDINGS{Gottschalk96obb-tree:a,
    author = {S. Gottschalk and M. C. Lint and D. Manocha},
    title = {OBB-Tree: A hierarchical structure for rapid interference detection},
    booktitle = {PROC. ACM SIGGRAPH, 171–180},
    year = {1996},
    publisher = {}
}

OpenURL

Abstract

We present a data structure and an algorithm for efficient and exact interference detection amongst complex models undergoing rigid motion. The algorithm is applicable to all general polygonal and curved models. It pre-computes a hierarchical representation of models using tight-fitting oriented bounding box trees. At runtime, the algorithm traverses the tree and tests for overlaps between oriented bounding boxes based on a new separating axis theorem, which takes less than 200 operations in practice. It has been implemented and we compare its performance with other hierarchical data structures. In particular, it can accurately detect all the contacts between large complex geometries composed of hundreds of thousands of polygons at interactive rates, almost one order of magnitude faster than earlier methods.

Keyphrases

rapid interference detection hierarchical structure data structure large complex geometry axis theorem rigid motion tight-fitting oriented bounding box tree curved model hierarchical data structure hierarchical representation general polygonal interactive rate

DMCA