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:20201213T122400
DTEND;TZID=Asia/Singapore:20201213T123000
UID:siggraphasia_SIGGRAPH Asia 2020_sess104_tog_104@linklings.com
SUMMARY:Fast Construction of Discrete Geodesic Graphs
DESCRIPTION:Technical Papers, Technical Papers Q&A\n\nFast Construction of
Discrete Geodesic Graphs\n\nAdikusuma, Fang, He\n\nThis paper develops a
new method for constructing Discrete Geodesic Graph (DGG)—an undirected, s
parse graph for computing discrete geodesic distances and paths on triangl
e meshes. Based on a novel accuracy aware window propagation scheme, our m
ethod is able to compute the graph edges in a direct and efficient manner.
Given a triangle mesh with n vertices and a user-specified accuracy param
eter ɛ, our method produces a DGG with O(n\√ɛ) edges in em
pirical O(n\ɛ0.75 log 1\ɛ) time, which greatly improves the time
complexity O(n\ɛ log 1\ɛ) of the existing method. Extensive eva
luation on a large-scale 3D shape repository shows that our method is effi
cient and can produce high-quality geodesic distances with predictable acc
uracy and guaranteed true distance metric. In particular, our method has a
great advantage over the existing approximate methods on meshes with high
degree of anisotropy. The source code is available at https://github.com/
GeodesicGraph..\n\nRegistration Category: Ultimate Supporter, Ultimate Att
endee
END:VEVENT
END:VCALENDAR