Shortest Path to Boundary for Self-Intersecting Meshes

Citations Over TimeTop 10% of 2023 papers

Abstract

We introduce a method for efficiently computing the exact shortest path to the boundary of a mesh from a given internal point in the presence of self-intersections. We provide a formal definition of shortest boundary paths for self-intersecting objects and present a robust algorithm for computing the actual shortest boundary path. The resulting method offers an effective solution for collision and self-collision handling while simulating deformable volumetric objects, using fast simulation techniques that provide no guarantees on collision resolution. Our evaluation includes complex self-collision scenarios with a large number of active contacts, showing that our method can successfully handle them by introducing a relatively minor computational overhead.

Related Papers

• → Intrinsic Continuous Collision Detection for Deformable Meshes(2005)3 cited
• Optimization of box-based algorithms for collision detection(2008)
• → A Collision Contact Modeling Method for Rigid Bodies Represented as Triangle Meshes(2004)
• → D03 Development of Tool Path Generation Method with Lower Calculation Cost Applying Progressive Mesh : Application of Cutting Point Dependent Refinement of Progressive Mesh(2014)
• → Active Learning of Neural Collision Handler for Complex 3D Mesh Deformations(2021)