{"title":"Kinetic Separation Lists for Continuous Collision Detection of Deformable Objects","authors":"René Weller, G. Zachmann","doi":"10.2312/PE/vriphys/vriphys06/033-042","DOIUrl":null,"url":null,"abstract":"We present a new acceleration scheme for continuous collision detection of objects under arbitrary deformations. Both pairwise and self collision detection are presented. This scheme is facilitated by a new acceleration data structure, the kinetic separation list. The event-based approach of our kinetic separation list enables us to transform the continuous problem into a discrete one. Thus, the number of updates of the bounding volume hierarchies as well as the number of bounding volume checks can be reduced significantly. We performed a comparison of our kinetic approaches with the classical swept volume algorithm. The results show that our algorithm performs up to fifty times faster in practically relevant scenarios.","PeriodicalId":446363,"journal":{"name":"Workshop on Virtual Reality Interactions and Physical Simulations","volume":"105 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Workshop on Virtual Reality Interactions and Physical Simulations","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2312/PE/vriphys/vriphys06/033-042","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19
Abstract
We present a new acceleration scheme for continuous collision detection of objects under arbitrary deformations. Both pairwise and self collision detection are presented. This scheme is facilitated by a new acceleration data structure, the kinetic separation list. The event-based approach of our kinetic separation list enables us to transform the continuous problem into a discrete one. Thus, the number of updates of the bounding volume hierarchies as well as the number of bounding volume checks can be reduced significantly. We performed a comparison of our kinetic approaches with the classical swept volume algorithm. The results show that our algorithm performs up to fifty times faster in practically relevant scenarios.