A distance hierarchy to detect collisions between deformable objects

Madera, Francisco A., Day, Andy M. and Laycock, Stephen D. (2007) A distance hierarchy to detect collisions between deformable objects. Theory and Practice of Computer Graphics. pp. 53-60.

Full text not available from this repository. (Request a copy)

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.

Item Type:	Article
Faculty \ School:	Faculty of Science > School of Computing Sciences
UEA Research Groups:	Faculty of Science > Research Groups > Interactive Graphics and Audio Faculty of Science > Research Groups > Computer Graphics (former - to 2018)
Depositing User:	Vishal Gautam
Date Deposited:	18 May 2011 13:21
Last Modified:	09 Jan 2024 01:22
URI:	https://ueaeprints.uea.ac.uk/id/eprint/22484
DOI:	10.2312/LocalChapterEvents/TPCG/TPCG07/053-060

Actions (login required)

View Item