EUVIMEDOpdag EUVIMED
Crossref

Shortest Path to Boundary for Self-Intersecting Meshes

He Chen, Elie Diaz, Cem Yuksel

ACM Transactions on Graphics · 2023-08 · 42 (4) · 1-15

DOI: 10.1145/3592136 ↗

At a glance

Journal article in ACM Transactions on Graphics, published online on 2023-07-26. Written by He Chen and 2 co-authors. Cited 16 times so far (Crossref); 55 references. Funded by: NSF.

AbstractBibliografiske oplysningerCiteRelated studies

Abstract (original language)

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.

Funding

  • NSF

Cite

APA

Chen, H., Diaz, E., & Yuksel, C. (2023). Shortest Path to Boundary for Self-Intersecting Meshes. ACM Transactions on Graphics, 42(4), 1-15. https://doi.org/10.1145/3592136

Vancouver

Chen H, Diaz E, Yuksel C. Shortest Path to Boundary for Self-Intersecting Meshes. ACM Transactions on Graphics. 2023;42(4):1-15. doi:10.1145/3592136

BibTeX
@article{Chen2023,
  author = {Chen, He and Diaz, Elie and Yuksel, Cem},
  title = {Shortest Path to Boundary for Self-Intersecting Meshes},
  journal = {ACM Transactions on Graphics},
  year = {2023},
  volume = {42},
  number = {4},
  pages = {1--15},
  doi = {10.1145/3592136}
}
Start for free →