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:20260817T171533Z
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:Lei Wang (Shandong University, School of Computer Science and 
 Technology); Xudong Wang and Pengfei Wang (Shandong University); Shuangmin
  Chen (Qingdao University of Science and Technology); Shiqing Xin and Jion
 g Guo (Shandong University); Wenping Wang (Texas A&M University); and Chan
 ghe Tu (Shandong University)\n\nSurface offsetting is a crucial operation 
 in digital geometry processing and computer-aided design, where an offset 
 is defined as an iso-value surface of the distance field. A challenge emer
 ges as even smooth surfaces can exhibit sharp features in their offsets du
 e to the non-differentiable characteristics of the underlying distance fie
 ld. Prevailing approaches to the offsetting problem involve approximating 
 the distance field and then extracting the iso-surface. However, even with
  dual contouring (DC), there is a risk of degrading sharp feature points/l
 ines due to the inaccurate discretization of the distance field. This issu
 e is exacerbated when the input is a piecewise-linear triangle mesh.\n\nTh
 is study is inspired by the observation that a triangle-based distance fie
 ld, unlike the complex distance field rooted at the entire surface, remain
 s smooth across the entire 3D space except at the triangle itself. With a 
 polygonal surface comprising $n$ triangles, the final distance field for a
 ccommodating the offset surface is determined by minimizing these $n$ tria
 ngle-based distance fields. In implementation, our approach starts by tetr
 ahedralizing the space around the offset surface, enabling a tetrahedron-w
 ise linear approximation for each triangle-based distance field. The final
  offset surface within a tetrahedral range can be traced by slicing the te
 trahedron with planes. As illustrated in the teaser figure, a key advantag
 e of our algorithm is its ability to precisely preserve sharp features. Fu
 rthermore, this paper addresses the problem of simplifying the offset surf
 ace’s complexity while preserving sharp features, formulating it as a maxi
 mal-clique problem.\n\nRegistration Category: Full Access, Full Access Sup
 porter\n\nLanguage Format: English Language\n\nSession Chair: Baoquan Chen
  (Peking University)\n\n
URL:https://asia.siggraph.org/2024/program/?id=papers_420&sess=sess103
END:VEVENT
END:VCALENDAR