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:20240214T070242Z
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:Technical Papers\n\nLorenzo 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 f
 or computing the constrained Delaunay tetrahedrization (CDT) of a piecewis
 e-linear complex, which has a 100% success rate on the 4408 valid models i
 n the Thingy10k dataset.\nWe build on the underlying theory of the well-kn
 own tetgen software, but use a floating-point implementation based on indi
 rect geometric predicates to implicitly represent Steiner points: this new
  approach dramatically simplifies the implementation, removing the need fo
 r ad-hoc tolerances in geometric operations. Our approach leads to a robus
 t and parameter-free implementation, with an empirically manageable number
  of added Steiner points. 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 te
 trahedrization conforms with the input geometry without approximations. We
  can further round our output to floating-point coordinates for downstream
  applications, which almost always results in valid floating-point meshes 
 unless the input triangulation is very close to being\ndegenerate.\n\nRegi
 stration Category: Full Access\n\nSession Chair: Nicholas Sharp (NVIDIA)
URL:https://asia.siggraph.org/2023/full-program?id=papers_398&sess=sess140
END:VEVENT
END:VCALENDAR