一般 SDF 之间的实时碰撞检测

IF 1.3 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Pengfei Liu , Yuqing Zhang , He Wang , Milo K. Yip , Elvis S. Liu , Xiaogang Jin
{"title":"一般 SDF 之间的实时碰撞检测","authors":"Pengfei Liu ,&nbsp;Yuqing Zhang ,&nbsp;He Wang ,&nbsp;Milo K. Yip ,&nbsp;Elvis S. Liu ,&nbsp;Xiaogang Jin","doi":"10.1016/j.cagd.2024.102305","DOIUrl":null,"url":null,"abstract":"<div><p>Signed Distance Fields (SDFs) have found widespread utility in collision detection applications due to their superior query efficiency and ability to represent continuous geometries. However, little attention has been paid to calculating the intersection of two arbitrary SDFs. In this paper, we propose a novel, accurate, and real-time approach for SDF-based collision detection between two solids, both represented as SDFs. Our primary strategy entails using interval calculations and the SDF gradient to guide the search for intersection points within the geometry. For arbitrary objects, we take inspiration from existing collision detection pipelines and segment the two SDFs into multiple parts with bounding volumes. Once potential collisions between two parts are identified, our method quickly computes comprehensive intersection information such as penetration depth, contact points, and contact normals. Our method is general in that it accepts both continuous and discrete SDF representations. Experiment results show that our method can detect collisions in high-precision models in real time, highlighting its potential for a wide range of applications in computer graphics and virtual reality.</p></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"111 ","pages":"Article 102305"},"PeriodicalIF":1.3000,"publicationDate":"2024-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Real-time collision detection between general SDFs\",\"authors\":\"Pengfei Liu ,&nbsp;Yuqing Zhang ,&nbsp;He Wang ,&nbsp;Milo K. Yip ,&nbsp;Elvis S. Liu ,&nbsp;Xiaogang Jin\",\"doi\":\"10.1016/j.cagd.2024.102305\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Signed Distance Fields (SDFs) have found widespread utility in collision detection applications due to their superior query efficiency and ability to represent continuous geometries. However, little attention has been paid to calculating the intersection of two arbitrary SDFs. In this paper, we propose a novel, accurate, and real-time approach for SDF-based collision detection between two solids, both represented as SDFs. Our primary strategy entails using interval calculations and the SDF gradient to guide the search for intersection points within the geometry. For arbitrary objects, we take inspiration from existing collision detection pipelines and segment the two SDFs into multiple parts with bounding volumes. Once potential collisions between two parts are identified, our method quickly computes comprehensive intersection information such as penetration depth, contact points, and contact normals. Our method is general in that it accepts both continuous and discrete SDF representations. Experiment results show that our method can detect collisions in high-precision models in real time, highlighting its potential for a wide range of applications in computer graphics and virtual reality.</p></div>\",\"PeriodicalId\":55226,\"journal\":{\"name\":\"Computer Aided Geometric Design\",\"volume\":\"111 \",\"pages\":\"Article 102305\"},\"PeriodicalIF\":1.3000,\"publicationDate\":\"2024-04-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Aided Geometric Design\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0167839624000396\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Aided Geometric Design","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167839624000396","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

摘要

有符号距离场(SDF)因其卓越的查询效率和表示连续几何图形的能力,已在碰撞检测应用中得到广泛应用。然而,人们很少关注计算两个任意 SDF 的交集。在本文中,我们提出了一种新颖、准确和实时的方法,用于基于 SDF 的碰撞检测,检测两个均表示为 SDF 的固体之间的碰撞。我们的主要策略是利用区间计算和 SDF 梯度来引导在几何体中搜索交点。对于任意物体,我们从现有的碰撞检测管道中汲取灵感,将两个 SDF 分割成多个具有边界体积的部分。一旦识别出两个部分之间的潜在碰撞,我们的方法就能快速计算出全面的交叉信息,如穿透深度、接触点和接触法线。我们的方法具有通用性,既可接受连续 SDF 表示法,也可接受离散 SDF 表示法。实验结果表明,我们的方法可以实时检测高精度模型中的碰撞,这凸显了它在计算机图形学和虚拟现实领域的广泛应用潜力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Real-time collision detection between general SDFs

Signed Distance Fields (SDFs) have found widespread utility in collision detection applications due to their superior query efficiency and ability to represent continuous geometries. However, little attention has been paid to calculating the intersection of two arbitrary SDFs. In this paper, we propose a novel, accurate, and real-time approach for SDF-based collision detection between two solids, both represented as SDFs. Our primary strategy entails using interval calculations and the SDF gradient to guide the search for intersection points within the geometry. For arbitrary objects, we take inspiration from existing collision detection pipelines and segment the two SDFs into multiple parts with bounding volumes. Once potential collisions between two parts are identified, our method quickly computes comprehensive intersection information such as penetration depth, contact points, and contact normals. Our method is general in that it accepts both continuous and discrete SDF representations. Experiment results show that our method can detect collisions in high-precision models in real time, highlighting its potential for a wide range of applications in computer graphics and virtual reality.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computer Aided Geometric Design
Computer Aided Geometric Design 工程技术-计算机:软件工程
CiteScore
3.50
自引率
13.30%
发文量
57
审稿时长
60 days
期刊介绍: The journal Computer Aided Geometric Design is for researchers, scholars, and software developers dealing with mathematical and computational methods for the description of geometric objects as they arise in areas ranging from CAD/CAM to robotics and scientific visualization. The journal publishes original research papers, survey papers and with quick editorial decisions short communications of at most 3 pages. The primary objects of interest are curves, surfaces, and volumes such as splines (NURBS), meshes, subdivision surfaces as well as algorithms to generate, analyze, and manipulate them. This journal will report on new developments in CAGD and its applications, including but not restricted to the following: -Mathematical and Geometric Foundations- Curve, Surface, and Volume generation- CAGD applications in Numerical Analysis, Computational Geometry, Computer Graphics, or Computer Vision- Industrial, medical, and scientific applications. The aim is to collect and disseminate information on computer aided design in one journal. To provide the user community with methods and algorithms for representing curves and surfaces. To illustrate computer aided geometric design by means of interesting applications. To combine curve and surface methods with computer graphics. To explain scientific phenomena by means of computer graphics. To concentrate on the interaction between theory and application. To expose unsolved problems of the practice. To develop new methods in computer aided geometry.
×
引用
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学术官方微信