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:20201212T050326Z
LOCATION:Zoom Room 1
DTSTART;TZID=Asia/Singapore:20201213T120000
DTEND;TZID=Asia/Singapore:20201213T123000
UID:siggraphasia_SIGGRAPH Asia 2020_sess104@linklings.com
SUMMARY:Meticulous Meshes
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 .
..\n\n---------------------\nBijective Projection in a Shell\n\nJiang, Sch
neider, Zorin, Panozzo\n\nWe introduce an algorithm to convert a self-inte
rsection free, orientable, and manifold triangle mesh into a generalized p
rismatic shell equipped with a bijective projection operator to map the tr
iangle mesh to a class of discrete surfaces contained within the shell who
se normals satisfy a simple lo...\n\n---------------------\nConforming Wei
ghted Delaunay Triangulations\n\nAlexa\n\nGiven a set of points together w
ith a set of simplices\nwe show how to compute weights associated with the
points such that the weighted Delaunay triangulation of the point set con
tains the simplices, if possible. For a given triangulated surface, this p
rocess provides a tetrahedral mesh conforming t...\n\n--------------------
-\nFast and Robust Mesh Arrangements using Floating-point Arithmetic\n\nCh
erchi, Livesu, Scateni, Attene\n\nWe introduce a novel algorithm to transf
orm any generic set of triangles in 3D space into a well-formed simplicial
complex. Intersecting elements in the input are correctly identified, sub
divided, and connected to arrange a valid configuration, leading to a topo
logically sound partition of the space...\n\n---------------------\nFast C
onstruction of Discrete Geodesic Graphs\n\nAdikusuma, Fang, He\n\nThis pap
er develops a new method for constructing Discrete Geodesic Graph (DGG)—an
undirected, sparse graph for computing discrete geodesic distances and pa
ths on triangle meshes. Based on a novel accuracy aware window propagation
scheme, our method is able to compute the graph edges in a direct and...\
n\n\nRegistration Category: Ultimate Supporter, Ultimate Attendee
END:VEVENT
END:VCALENDAR