BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:Asia/Tokyo
X-LIC-LOCATION:Asia/Tokyo
BEGIN:STANDARD
TZOFFSETFROM:+0900
TZOFFSETTO:+0900
TZNAME:JST
DTSTART:18871231T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20250110T023309Z
LOCATION:Hall B5 (1)\, B Block\, Level 5
DTSTART;TZID=Asia/Tokyo:20241203T134600
DTEND;TZID=Asia/Tokyo:20241203T135800
UID:siggraphasia_SIGGRAPH Asia 2024_sess103_papers_420@linklings.com
SUMMARY:PCO: Precision-Controllable Offset Surfaces with Sharp Features
DESCRIPTION:Technical Papers\n\nLei Wang (Shandong University, School of C
 omputer Science and Technology); Xudong Wang and Pengfei Wang (Shandong Un
 iversity); Shuangmin Chen (Qingdao University of Science and Technology); 
 Shiqing Xin and Jiong Guo (Shandong University); Wenping Wang (Texas A&M U
 niversity); and Changhe Tu (Shandong University)\n\nSurface offsetting is 
 a crucial operation in digital geometry processing and computer-aided desi
 gn, where an offset is defined as an iso-value surface of the distance fie
 ld. A challenge emerges as even smooth surfaces can exhibit sharp features
  in their offsets due to the non-differentiable characteristics of the und
 erlying distance field. Prevailing approaches to the offsetting problem in
 volve approximating the distance field and then extracting the iso-surface
 . However, even with dual contouring (DC), there is a risk of degrading sh
 arp feature points/lines due to the inaccurate discretization of the dista
 nce field. This issue is exacerbated when the input is a piecewise-linear 
 triangle mesh.\n\nThis study is inspired by the observation that a triangl
 e-based distance field, unlike the complex distance field rooted at the en
 tire surface, remains smooth across the entire 3D space except at the tria
 ngle itself. With a polygonal surface comprising $n$ triangles, the final 
 distance field for accommodating the offset surface is determined by minim
 izing these $n$ triangle-based distance fields. In implementation, our app
 roach starts by tetrahedralizing the space around the offset surface, enab
 ling a tetrahedron-wise linear approximation for each triangle-based dista
 nce field. The final offset surface within a tetrahedral range can be trac
 ed by slicing the tetrahedron with planes. As illustrated in the teaser fi
 gure, a key advantage of our algorithm is its ability to precisely preserv
 e sharp features. Furthermore, this paper addresses the problem of simplif
 ying the offset surface’s complexity while preserving sharp features, form
 ulating it as a maximal-clique problem.\n\nRegistration Category: Full Acc
 ess, Full Access Supporter\n\nLanguage Format: English Language\n\nSession
  Chair: Baoquan Chen (Peking University)
URL:https://asia.siggraph.org/2024/program/?id=papers_420&sess=sess103
END:VEVENT
END:VCALENDAR