Presentation / Installation


Shortest Path to Boundary for Self-intersecting Meshes
SessionMaking Contact: Simulating and Detecting Collisions
DescriptionWe introduce a method for efficiently computing the exact shortest path to the boundary of a self-intersecting mesh from a given internal point. It 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.
Authors
He Chen
University of Utah
Elie Diaz
University of Utah
Cem Yuksel
University of Utah
Roblox Research
Event Type
Technical Paper
TimeThursday, 10 August 20232:11pm - 2:22pm PDT
LocationPetree Hall C
ACM Digital Library Technical Papers pdfs
Session Time & Location
Sunday, 6 August 20236pm - 8:30pm PDTWest Hall B
Thursday, 10 August 20232pm - 3:30pm PDTPetree Hall C
Interest Areas
Research & Education
Recordings
Livestreamed
Recorded
Keywords
Animation/Simulation
Modeling
Registration Categories
FC
FCS
V
VS
EFC
Next PresentationNext Presentation
P2M: A Fast Solver for Querying Distance From Point to Mesh Surface