可变形物体连续碰撞检测的动力学分离列表

René Weller, G. Zachmann
{"title":"可变形物体连续碰撞检测的动力学分离列表","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":"{\"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}","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

摘要

提出了一种用于任意变形下物体连续碰撞检测的加速度方案。提出了双碰撞检测和自碰撞检测。该方案采用了一种新的加速度数据结构,即动力学分离表。我们的动力学分离表的基于事件的方法使我们能够将连续问题转化为离散问题。因此,可以显著减少边界卷层次结构的更新次数以及边界卷检查的次数。我们将我们的动力学方法与经典的扫描体积算法进行了比较。结果表明,我们的算法在实际相关场景中执行速度提高了50倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Kinetic Separation Lists for Continuous Collision Detection of Deformable Objects
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信