BD-Tree: Output-Sensitive Collision Detection for Reduced Deformable Models
Doug L. James, Dinesh K. Pai
ACM Transactions on Graphics / SIGGRAPH 2004 (2004)
teaser

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 arbitary 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 reduced deformation coordinates. We show that the BD-Tree is also extremely simple to implement, and performs well in practice for a variety of real-time and complex off-line deformable simulation examples.

Doug L. James, Dinesh K. Pai (2004). BD-Tree: Output-Sensitive Collision Detection for Reduced Deformable Models. ACM Transactions on Graphics / SIGGRAPH 2004, 23(3).

@article{James:2004:BDTree,
author = "Doug L. James and Dinesh K. Pai",
title = "BD-Tree: Output-Sensitive Collision Detection for Reduced Deformable Models",
year = "2004",
month = aug,
journal = "ACM Transactions on Graphics / SIGGRAPH 2004",
volume = "23",
number = "3",
links = "http://graphics.cs.cmu.edu/projects/bdtree/",
}