Efficient collision detection for models deformed by morphing
Thomas Larsson, Tomas Akenine-Möller
In The Visual Computer, 19(2), 2003.
Abstract: We describe a fast and accurate collision-detection algorithm specialised for models deformed by morphing. The models considered are meshes where the vertex positions are convex combinations of sets of reference meshes. This new method is based on bounding-volume trees that are extended to support efficient tree-node updates by blending associated sets of reference bounding volumes. With our approach, it is possible to use either axis-aligned bounding boxes, discrete-orientation polytopes, or spheres as bounding volumes. The expected performance of our algorithm is of the same order as for rigid hierarchical collision detection. In our tested scenarios, the speed-up we achieved ranged from 1.5 to 58, compared to another more general algorithm for deforming bodies.
Keyword(s): collision detection, morphing, deformable bodies, hierarchical data structures, virtual reality
BibTeX format:
@article{Larsson:2003:ECD,
  author = {Thomas Larsson and Tomas Akenine-Möller},
  title = {Efficient collision detection for models deformed by morphing},
  journal = {The Visual Computer},
  volume = {19},
  number = {2},
  pages = {164--174},
  year = {2003},
}
Search for more articles by Thomas Larsson.
Search for more articles by Tomas Akenine-Möller.

Return to the search page.


graphbib: Powered by "bibsql" and "SQLite3."