BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:Asia/Singapore
X-LIC-LOCATION:Asia/Singapore
BEGIN:STANDARD
TZOFFSETFROM:+0800
TZOFFSETTO:+0800
TZNAME:SGT
DTSTART:19820101T123000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20201212T050125Z
LOCATION:Zoom Room 1
DTSTART;TZID=Asia/Singapore:20201213T121200
DTEND;TZID=Asia/Singapore:20201213T121800
UID:siggraphasia_SIGGRAPH Asia 2020_sess104_papers_327@linklings.com
SUMMARY:You Can Find Geodesic Paths in Triangle Meshes by Just Flipping Ed
ges
DESCRIPTION:Technical Papers, Technical Papers Q&A\n\nYou Can Find Geodesi
c Paths in Triangle Meshes by Just Flipping Edges\n\nSharp, Crane\n\nThis
paper describes a new approach to computing exact geodesics on polyhedral
surfaces. The basic idea is to perform edge flips, in the same spirit as
the classic Delaunay flip algorithm. As a natural byproduct of this pro
cess, one also obtains a triangulation containing the shortened paths as e
dges. More precisely, given a path as a sequence of mesh edges, we transf
orm it into a locally shortest geodesic path while avoiding self-crossings
(i.e., we find a geodesic in the same isotopy class). Implementation amo
unts to a simple subroutine that flips edges to create a shorter path with
in their local neighborhood. The method is guaranteed to produce an exact
geodesic path in a finite number of operations; practical runtimes are on
the order of a few milliseconds, even for meshes with millions of faces.
It is easily applied to cases beyond simple paths, including closed loops
, curve networks, and multiply-covered curves. The method is well-suited
for applications in geometry processing: it guarantees that curves do not
cross, a necessary property when straightening region boundaries or cut ne
tworks, and furthermore it yields an intrinsic triangulation which include
s the geodesic curves as edges, extending the idea of a \emph{constrained
Delaunay triangulation} to curved surfaces. Evaluation on large datasets
indicates that the method is both efficient and robust even for challengin
g models with low-quality triangulations. We explore how the curves and t
riangulations produced by the method facilitate a variety of tasks in digi
tal geometry processing such as straightening cuts and segmentation bounda
ries, computing geodesic Bézier curves, and providing accurate boundary co
nditions for PDEs.\n\nRegistration Category: Ultimate Supporter, Ultimate
Attendee
END:VEVENT
END:VCALENDAR