Abstract
Surface remeshing is a key component in many geometry processing applications. However, existing high quality remeshing methods usually introduce approximation errors that are difficult to control, while error-driven approaches pay little attention to the meshing quality. Moreover, neither of those approaches can guarantee the minimal angle bound in resulting meshes. We propose a novel error-bounded surface remeshing approach that is based on minimal angle elimination. Our method employs a dynamic priority queue that first parameterize triangles who contain angles smaller than a user-specified threshold. Then, those small angles are eliminated by applying several local operators ingeniously. To control the geometric fidelity where local operators are applied, an efficient local error measure scheme is proposed and integrated in our remeshing framework. The initial results show that the proposed approach is able to bound the geometric fidelity strictly, while the minimal angles of the results can be eliminated to be up to 40 degrees.
Original language | English (US) |
---|---|
Title of host publication | SIGGRAPH 2016 - ACM SIGGRAPH 2016 Posters |
Publisher | Association for Computing Machinery, Inc |
ISBN (Electronic) | 9781450343718 |
DOIs | |
State | Published - Jul 24 2016 |
Externally published | Yes |
Event | ACM International Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 2016 - Anaheim, United States Duration: Jul 24 2016 → Jul 28 2016 |
Publication series
Name | SIGGRAPH 2016 - ACM SIGGRAPH 2016 Posters |
---|
Other
Other | ACM International Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 2016 |
---|---|
Country/Territory | United States |
City | Anaheim |
Period | 07/24/16 → 07/28/16 |
Bibliographical note
Publisher Copyright:© 2016 Copyright held by the owner/author(s).
Keywords
- Error-bounded
- Minimal angle
- Surface remeshing
ASJC Scopus subject areas
- Computer Graphics and Computer-Aided Design
- Human-Computer Interaction
- Software