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:20260114T163653Z
LOCATION:Meeting Room C4.11\, Level 4 (Convention Centre)
DTSTART;TZID=Australia/Melbourne:20231214T140000
DTEND;TZID=Australia/Melbourne:20231214T141500
UID:siggraphasia_SIGGRAPH Asia 2023_sess130_papers_176@linklings.com
SUMMARY:Robust Zero Level-Set Extraction from Unsigned Distance Fields Bas
 ed on Double Covering
DESCRIPTION:Fei Hou (Institute of Software, Chinese Academy of Sciences; U
 niversity of Chinese Academy of Sciences); Xuhui Chen and Wencheng Wang (I
 nstitute of Software, Chinese Academy Of Sciences; University of Chinese A
 cademy of Sciences); Hong Qin (Stony Brook University); and Ying He (Nanya
 ng Technological University)\n\nIn this paper, we propose a new method, ca
 lled DoubleCoverUDF, for extracting the zero level-set from unsigned dista
 nce fields (UDFs). DoubleCoverUDF takes a learned UDF and a user-specified
  parameter r (a small positive real number) as input and extracts an iso-s
 urface with an iso-value r using the conventional marching cubes algorithm
 . We show that the computed iso-surface is the boundary of the r-offset vo
 lume of the target zero level-set S, which is an orientable manifold, rega
 rdless of the topology of S. Next, the algorithm computes a covering map t
 o project the boundary mesh onto S, preserving the mesh's topology and avo
 iding folding. If S is an orientable manifold surface, our algorithm separ
 ates the double-layered mesh into a single layer using a robust minimum-cu
 t post-processing step. Otherwise, it keeps the double-layered mesh as the
  output. We validate our algorithm by reconstructing 3D surfaces of open m
 odels and demonstrate its efficacy and effectiveness on synthetic models a
 nd benchmark datasets. Our experimental results confirm that our method is
  robust and produces meshes with better quality in terms of both visual ev
 aluation and quantitative measures than existing UDF-based methods. The so
 urce code is available at https://github.com/jjjkkyz/DCUDF.\n\nRegistratio
 n Category: Full Access\n\nSession Chair: Baoquan Chen (Peking University)
 \n\n
URL:https://asia.siggraph.org/2023/full-program?id=papers_176&sess=sess130
END:VEVENT
END:VCALENDAR
