Advanced

Efficient Collision Detection for Models Deformed by Morphing

Larsson, Thomas and Akenine-Möller, Tomas LU (2003) In Visual Computer 19(2). p.164-174
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... (More)
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. (Less)
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Contribution to journal
publication status
published
subject
keywords
Hierarchical data structures, Virtual reality, Collision detection, Morphing, Deformable bodies
in
Visual Computer
volume
19
issue
2
pages
164 - 174
publisher
Springer
external identifiers
  • scopus:0038111981
ISSN
0178-2789
language
English
LU publication?
yes
id
aabc0095-bc4f-4d28-8b8c-e7e4e447dd82 (old id 747822)
alternative location
http://www.springerlink.com/content/gkuqq5q6fupqwge0/fulltext.pdf
date added to LUP
2008-01-11 14:25:23
date last changed
2017-01-01 07:23:36
@article{aabc0095-bc4f-4d28-8b8c-e7e4e447dd82,
  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.},
  author       = {Larsson, Thomas and Akenine-Möller, Tomas},
  issn         = {0178-2789},
  keyword      = {Hierarchical data structures,Virtual reality,Collision detection,Morphing,Deformable bodies},
  language     = {eng},
  number       = {2},
  pages        = {164--174},
  publisher    = {Springer},
  series       = {Visual Computer},
  title        = {Efficient Collision Detection for Models Deformed by Morphing},
  volume       = {19},
  year         = {2003},
}