A Distance Hierarchy to Detect Collisions Between Deformable Objects

Simple item page
dc.contributor.authorMadera, Francisco A.en_US
dc.contributor.authorDay, Andy M.en_US
dc.contributor.authorLaycock, Stephen D.en_US
dc.contributor.editorIk Soo Lim and David Duceen_US
dc.date.accessioned2014-01-31T19:58:08Z
dc.date.available2014-01-31T19:58:08Z
dc.date.issued2007en_US
dc.description.abstractTo 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.en_US
dc.description.seriesinformationTheory and Practice of Computer Graphicsen_US
dc.identifier.isbn978-3-905673-63-0en_US
dc.identifier.urihttps://doi.org/10.2312/LocalChapterEvents/TPCG/TPCG07/053-060en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectCategories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Computational Geometry and Object Modellingen_US
dc.titleA Distance Hierarchy to Detect Collisions Between Deformable Objectsen_US
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
053-060.pdf
Size:
354.12 KB
Format:
Adobe Portable Document Format
Download
Collections
EG UK Theory and Practice of Computer Graphics 2007