Continuous collision detection for non-rigid contact computations using local advancement

Min Tang, Young J. Kim, Dinesh Manocha

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

13 Scopus citations

Abstract

We present a novel algorithm to perform continuous collision detection(CCD) between non-rigid, deformable models using local advancement. Given the initial and final configurations of a deformable model, our algorithm computes linear deformation by interpolating the vertices from the initial to the final configurations with a straight line path and checks for collision along that path. Our approach is applicable to polygon-soup models with arbitrary topology, handles self-collisions and makes no assumption about the underlying non-rigid motion. We accelerate the algorithm by computing motion bounds on the primitives and their bounding volumes. These bounds are combined with hierarchical culling techniques and used for fast collision checking. In practice, we have observed up to four times improvement in running time because of local advancement.

Original languageEnglish
Title of host publication2010 IEEE International Conference on Robotics and Automation, ICRA 2010
Pages4016-4021
Number of pages6
DOIs
StatePublished - 2010
Event2010 IEEE International Conference on Robotics and Automation, ICRA 2010 - Anchorage, AK, United States
Duration: 3 May 20107 May 2010

Publication series

NameProceedings - IEEE International Conference on Robotics and Automation
ISSN (Print)1050-4729

Conference

Conference2010 IEEE International Conference on Robotics and Automation, ICRA 2010
Country/TerritoryUnited States
CityAnchorage, AK
Period3/05/107/05/10

Fingerprint

Dive into the research topics of 'Continuous collision detection for non-rigid contact computations using local advancement'. Together they form a unique fingerprint.

Cite this