Improving the Numerical Robustness of Sphere Swept Collision Detection
Jeff Linahan

TL;DR
This paper enhances the numerical robustness of a sphere-triangle collision detection algorithm, reducing penetration and jittering issues to improve accuracy and reliability in collision response.
Contribution
It introduces specific improvements to the algorithm's numerical robustness, addressing penetration and jittering problems in collision detection.
Findings
Reduced sphere penetration in collision detection
Minimized jittering during collision response
Enhanced stability of the collision detection algorithm
Abstract
This paper discusses improvements to the numerical robustness of the algorithm described in Kasper Fauerby's "Improved Collision Detection and Response." The algorithm addresses a common collision detection query: a moving sphere or ellipsoid vs. a set of motionless triangles. In its current form, the algorithm allows the sphere to penetrate the triangles. The sphere also displays "jittering" behavior when colliding with certain geometry. Most of these problems are the product of insufficient attention to numerical robustness, the focus of this paper. Motivated by the importance of numerical robustness in collision detection code, this paper addresses these problems in detail and proposes efficient solutions to them.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFormal Methods in Verification · Robotic Path Planning Algorithms · Computational Geometry and Mesh Generation
