Collision Detection for Deformable Objects using Octrees
Abstract
We present an algorithm for collision detection between multiple deformable objects translating in a large environment. We use Spatial Partitioning to subdivide the scene and a Bounding Volume Hierarchy to decompose the objects, using octrees in both cases. The algorithm is divided in two parts, the Broad and Narrow Phases, with objects that can be rigid or deformable. In the Broad Phase, an octree is used to partition the scene and cull away the object s Bounding Volumes that are distant. In the Narrow Phase, a hierarchical decomposition of Axis Aligned Bounding Boxes or spheres is employed to reduce the number of primitives in the pairwise comparisons. In summary this work is a general-purpose collision detection technique for performing real time collision detection of deformable bodies in interactive 3D applications.
BibTeX
@inproceedings {10.2312:LocalChapterEvents:TPCG:TPCG06:115-122,
booktitle = {Theory and Practice of Computer Graphics 2006},
editor = {Louise M. Lever and Mary McDerby},
title = {{Collision Detection for Deformable Objects using Octrees}},
author = {Madera, F. A. and Day, A. M. and Laycock, S. D.},
year = {2006},
publisher = {The Eurographics Association},
ISBN = {3-905673-59-2},
DOI = {10.2312/LocalChapterEvents/TPCG/TPCG06/115-122}
}
booktitle = {Theory and Practice of Computer Graphics 2006},
editor = {Louise M. Lever and Mary McDerby},
title = {{Collision Detection for Deformable Objects using Octrees}},
author = {Madera, F. A. and Day, A. M. and Laycock, S. D.},
year = {2006},
publisher = {The Eurographics Association},
ISBN = {3-905673-59-2},
DOI = {10.2312/LocalChapterEvents/TPCG/TPCG06/115-122}
}