A Distance Hierarchy to Detect Collisions Between Deformable Objects
No Thumbnail Available
Date
2007
Journal Title
Journal ISSN
Volume Title
Publisher
The Eurographics Association
Abstract
To detect collisions between deformable objects we introduce an algorithm that computes the closest distances between certain feature points defined in their meshes. The strategy is to divide the objects into regions and to define a representative vertex that serves to compute the distance to the regions of the other objects. Having obtained the closest regions between two objects, we proceed to explore these regions by expanding them and detecting the closest sub-regions. We handle a hierarchy of regions and distances where the first level contains n1 regions, each one is divided into n2 sub-regions, and so on. A collision is obtained when the distance between two vertices in the last level of the tree is less than a predefined value e. The advantage of our algorithm is that we can follow the deformation of the surface with the representative vertices defined in the hierarchy.
Description
@inproceedings{:10.2312/LocalChapterEvents/TPCG/TPCG07/053-060,
booktitle = {Theory and Practice of Computer Graphics},
editor = {Ik Soo Lim and David Duce},
title = {{A Distance Hierarchy to Detect Collisions Between Deformable Objects}},
author = {Madera, Francisco A. and Day, Andy M. and Laycock, Stephen D.},
year = {2007},
publisher = {The Eurographics Association},
ISBN = {978-3-905673-63-0},
DOI = {/10.2312/LocalChapterEvents/TPCG/TPCG07/053-060}
}