Shortest Path to Boundary for Self-Intersecting Meshes
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.
Cite
@article{arxiv.2305.09778,
title = {Shortest Path to Boundary for Self-Intersecting Meshes},
author = {He Chen and Elie Diaz and Cem Yuksel},
journal= {arXiv preprint arXiv:2305.09778},
year = {2023}
}