The use of Tetrahedra to Detect Collisions

Simple item page
dc.contributor.authorMadera, F. A.en_US
dc.contributor.authorDay, A. M.en_US
dc.contributor.authorLaycock, S. D.en_US
dc.contributor.editorCesar Mendoza and Isabel Navazoen_US
dc.date.accessioned2014-02-01T06:53:31Z
dc.date.available2014-02-01T06:53:31Z
dc.date.issued2006en_US
dc.description.abstractWe present an algorithm for collision detection by filling the free space between the objects involved. We compute the closest regions of a pair of objects, and update them during the running simulation. The algorithm is fast because the process depends on the number of neighbouring features of a vertex, the region, and not on all the features of the object. Furthermore, our algorithm is accurate because it deals directly with the features of the objects. This work deals with convex objects, and forms the first part of the general approach for deformable objects.en_US
dc.description.seriesinformationVriphys: 3rd Workshop in Virtual Realitiy, Interactions, and Physical Simulationen_US
dc.identifier.isbn3-905673-61-4en_US
dc.identifier.urihttps://doi.org/10.2312/PE/vriphys/vriphys06/121-122en_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.titleThe use of Tetrahedra to Detect Collisionsen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
121-122.pdf
Size:
330.02 KB
Format:
Adobe Portable Document Format
Download
Collections
vriphys06