Real-time Collision Detection between General SDFs

GMP 2024 (Best Paper Award)


Pengfei Liu1*, Yuqing Zhang1*, He Wang2, Milo K. Yip3, Elvis S. Liu3, Xiaogang Jin1†

1State Key Lab of CAD&CG, Zhejiang University    2University of Leeds     3MoreFun Studios, Tencent Games    
*The first two authors contribute equally.    Corresponding authors.   

Abstract



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 ar-bitrary 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.


Citation



              @article{liu2024real,
                title={Real-time collision detection between general SDFs},
                author={Liu, Pengfei and Zhang, Yuqing and Wang, He and Yip, Milo K and Liu, Elvis S and Jin, Xiaogang},
                journal={Computer Aided Geometric Design},
                volume={111},
                pages={102305},
                year={2024},
                publisher={Elsevier}
              }