BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:Australia/Melbourne
X-LIC-LOCATION:Australia/Melbourne
BEGIN:DAYLIGHT
TZOFFSETFROM:+1000
TZOFFSETTO:+1100
TZNAME:AEDT
DTSTART:19721003T020000
RRULE:FREQ=YEARLY;BYMONTH=4;BYDAY=1SU
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:19721003T020000
TZOFFSETFROM:+1100
TZOFFSETTO:+1000
TZNAME:AEST
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260114T163642Z
LOCATION:Meeting Room C4.8\, Level 4 (Convention Centre)
DTSTART;TZID=Australia/Melbourne:20231212T141500
DTEND;TZID=Australia/Melbourne:20231212T143000
UID:siggraphasia_SIGGRAPH Asia 2023_sess140_papers_398@linklings.com
SUMMARY:Constrained Delaunay Tetrahedrization: A Robust and Practical Appr
 oach
DESCRIPTION:Lorenzo Diazzi (UNIMORE, CNR-IMATI: GENOVA); Daniele Panozzo (
 NYU); Amir Vaxman (University of Edinburgh); and Marco Attene (CNR-IMATI: 
 GENOVA)\n\nWe present a numerically robust algorithm for computing the con
 strained Delaunay tetrahedrization (CDT) of a piecewise-linear complex, wh
 ich has a 100% success rate on the 4408 valid models in the Thingy10k data
 set.\nWe build on the underlying theory of the well-known tetgen software,
  but use a floating-point implementation based on indirect geometric predi
 cates to implicitly represent Steiner points: this new approach dramatical
 ly simplifies the implementation, removing the need for ad-hoc tolerances 
 in geometric operations. Our approach leads to a robust and parameter-free
  implementation, with an empirically manageable number of added Steiner po
 ints. Furthermore, our algorithm addresses a major gap in tetgen’s theory 
 which may lead to algorithmic failure on valid models, even when assuming 
 infinite precision in the calculations.\nOur output tetrahedrization confo
 rms with the input geometry without approximations. We can further round o
 ur output to floating-point coordinates for downstream applications, which
  almost always results in valid floating-point meshes unless the input tri
 angulation is very close to being\ndegenerate.\n\nRegistration Category: F
 ull Access\n\nSession Chair: Nicholas Sharp (NVIDIA)\n\n
URL:https://asia.siggraph.org/2023/full-program?id=papers_398&sess=sess140
END:VEVENT
END:VCALENDAR