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:20231212T143000
DTEND;TZID=Australia/Melbourne:20231212T144500
UID:siggraphasia_SIGGRAPH Asia 2023_sess140_papers_273@linklings.com
SUMMARY:3D Bézier Guarding: Boundary-Conforming Curved Tetrahedral Meshing
DESCRIPTION:Technical Papers\n\nPayam Khanteimouri and Marcel Campen (Osna
 brück University)\n\nWe present a method for the generation of higher-orde
 r tetrahedral meshes. In contrast to previous methods, the curved tetrahed
 ral elements are guaranteed to be free of degeneracies and inversions whil
 e conforming exactly to prescribed piecewise polynomial surfaces, such as 
 domain boundaries or material interfaces. Arbitrary polynomial order is su
 pported. Algorithmically, the polynomial input surfaces are first covered 
 by a single layer of carefully constructed curved elements using a recursi
 ve refinement procedure that provably avoids degeneracies and inversions. 
 These tetrahedral elements are designed such that the remaining space is b
 ounded piecewise linearly. In this way, our method effectively reduces the
  curved meshing problem to the classical problem of linear mesh generation
  (for the remaining space).\n\nRegistration Category: Full Access\n\nSessi
 on Chair: Nicholas Sharp (NVIDIA)
URL:https://asia.siggraph.org/2023/full-program?id=papers_273&sess=sess140
END:VEVENT
END:VCALENDAR