.png){kind=icon}
.png){kind=icon}
Return
Shortest Path to Boundary for Self-Intersecting Meshes
.png){kind=icon}
OA
AI
DOI：10.1145/3592136.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Collision response
Computational geometry
geodesics
shortest path
Journal
IF:
9.5
Papers:
4.7K
Citations:
3.6W