BD-Tree: Output-Sensitive Collision Detection for Reduced Deformable Models

DMCA

BD-Tree: Output-Sensitive Collision Detection for Reduced Deformable Models (2004)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Doug L. James , Dinesh K. Pai

Venue:	ACM Transactions on Graphics (SIGGRAPH
Citations:	98 - 11 self

BibTeX

@ARTICLE{James04bd-tree:output-sensitive,
    author = {Doug L. James and Dinesh K. Pai},
    title = {BD-Tree: Output-Sensitive Collision Detection for Reduced Deformable Models},
    journal = {ACM Transactions on Graphics (SIGGRAPH},
    year = {2004},
    volume = {23},
    pages = {393--398}
}

OpenURL

Abstract

We introduce the Bounded Deformation Tree, or BD-Tree, which can perform collision detection with reduced deformable models at costs comparable to collision detection with rigid objects. Reduced deformable models represent complex deformations as linear superpositions of arbitrary displacement fields, and are used in a variety of applications of interactive computer graphics. The BD-Tree is a bounding sphere hierarchy for output-sensitive collision detection with such models. Its bounding spheres can be updated after deformation in any order, and at a cost independent of the geometric complexity of the model; in fact the cost can be as low as one multiplication and addition per tested sphere, and at most linear in the number of reduced deformation coordinates. We show that the BDTree is also extremely simple to implement, and performs well in practice for a variety of real-time and complex off-line deformable simulation examples.

Keyphrases

reduced deformable model output-sensitive collision detection geometric complexity complex off-line deformable simulation example arbitrary displacement field bounding sphere bounding sphere hierarchy rigid object linear superposition reduced deformation coordinate collision detection bounded deformation tree complex deformation interactive computer graphic

DMCA