arrow
Return

PCO: Precision-Controllable Offset Surfaces with Sharp Features

delete2024-11-19
delete0
PRE
AI
L
Lei Wang
X
Xudong Wang
P
Pengfei Wang
S
Shuangmin Chen *
辛士庆 cover
辛士庆 (Shiqing Xin)
J
Jiong Guo
Wang, Wenping cover
Wang, Wenping (Wenping Wang)
C
Changhe Tu
DOI:10.1145/3687920delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Surface 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 emerges as even smooth surfaces can exhibit sharp features in their offsets due to the non-differentiable characteristics of the underlying distance field. 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/lines due to the inaccurate discretization of the distance field. This issue is exacerbated when the input is a piecewise-linear triangle mesh. This study is inspired by the observation that a triangle-based distance field, unlike the complex distance field rooted at the entire surface, remains smooth across the entire 3D space except at the triangle itself. With a polygonal surface comprising n triangles, the final distance field for accommodating the offset surface is determined by minimizing these n triangle-based distance fields. In implementation, our approach starts by tetrahedralizing the space around the offset surface, enabling a tetrahedron-wise linear approximation for each triangle-based distance field. The final offset surface within a tetrahedral range can be traced by slicing the tetrahedron with planes. As illustrated in the teaser figure, a key advantage of our algorithm is its ability to precisely preserve sharp features. Furthermore, this paper addresses the problem of simplifying the offset surface's complexity while preserving sharp features, formulating it as a maximal-clique problem.
Keywords:
digital geometry processing
polygonal surface
offset
sharp feature
maximal clique

Journal

ACM Transactions on Graphics cover
ACM Transactions on Graphics
IF:
9.5
Papers:
4.8K
Citations:
3.6W

Organization

S
shandong university
Scholars:
9.5W
Papers: 6.4W
Citations: 94
T
Texas A&M University System
Scholars:
4.4W
Papers: 4.0W
Citations: 4.0K
Cited Papers

Cited Papers

Uniparental Inheritance of Chloroplast DNA Is Strict in the Isogamous Volvocalean Gonium
err2011-04-29
err0
errOAAI
errYuka Setohigashi; Takashi Hamaji; Mahoko Hayama; Ryo Matsuzaki; Hisayoshi Nozaki
errShare
errSave
errShare
errSave
Band alignment studies in InN/p-Si(100) heterojunctions by x-ray photoelectron spectroscopy
err2011-06-21
err0
PREAI
errThirumaleshwara N. Bhat; Mahesh Kumar; Mohana K. Rajpalke; Basanta Roul; S. B. Krupanidhi; Neeraj Sinha
errShare
errSave
errShare
errSave
Controlled linear perturbation
err2011-10-01
err7
PREAI
errSacks, Elisha; Milenkovic, Victor; Kyung, Min-Ho
errShare
errSave
Robust polyhedral Minkowski sums with GPU implementation
err2015-10-01
err8
errOAAI
errKyung, Min-Ho; Sacks, Elisha; Milenkovic, Victor
errShare
errSave
Dialogues with Ethnography
err
IF0
err2018-01-31
err0
PREAI
errJan Blommaert
errShare
errSave
Bendamustin-Rituximab Induction Followed by Observation or Rituximab Maintenance for Newly Diagnosed Patients with Waldenström's Macroglobulinemia: Results From a Prospective, Randomized, Multicenter Study (StiL NHL 7–2008 –MAINTAIN-; ClinicalTrials.gov Identifier: NCT00877214).
err2012-11-16
err0
PREAI
errMathias J. Rummel; Christian Lerchenmüller; Richard Greil; Martin Görner; Manfred Hensel; Erik Engel; Ulrich Jaeger; Friedhelm Breuer; Bernd Hertenstein; Otto Prummer; Christian Buske; Juergen Barth; Alexander C. Burchardt; Wolfram Brugger
errShare
errSave
researcher View more