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:20201212T050108Z
LOCATION:Zoom Room 6
DTSTART;TZID=Asia/Singapore:20201211T104500
DTEND;TZID=Asia/Singapore:20201211T105000
UID:siggraphasia_SIGGRAPH Asia 2020_sess109_papers_372@linklings.com
SUMMARY:To cut or to fill: a global optimization approach to topological s
implification
DESCRIPTION:Technical Papers, Technical Papers Q&A\n\nTo cut or to fill: a
global optimization approach to topological simplification\n\nZeng, Chamb
ers, Letscher, Ju\n\nWe present a novel algorithm for simplifying the topo
logy of a 3D shape, which is characterized by the number of connected comp
onents, handles, and cavities. Existing methods either limit their modific
ations to be only cutting or only filling, or take a heuristic approach to
decide where to cut or fill. We consider the problem of finding a globall
y optimal set of cuts and fills that achieve the simplest topology while m
inimizing geometric changes. We show that the problem can be formulated as
graph labelling, and we solve it by a transformation to the Node-Weighted
Steiner Tree problem. When tested on examples with varying levels of topo
logical complexity, the algorithm shows notable improvement over existing
simplification methods in both topological simplicity and geometric distor
tions.\n\nRegistration Category: Ultimate Supporter, Ultimate Attendee
END:VEVENT
END:VCALENDAR