Topology simplification for polygonal virtual environments
Abstract
We present a topology simplifying approach that can be used for genus reductions, removal of protuberances, and repair of cracks in polygonal models in a unified framework. Our work is complementary to the existing work on geometry simplification of polygonal datasets and we demonstrate that using topology and geometry simplifications together yields superior multiresolution hierarchies than is possible by using either of them alone. Our approach can also address the important issue of repair of cracks in polygonal models, as well as for rapid identification and removal of protuberances based on internal accessibility in polygonal models. Our approach is based on identifying holes and cracks by extending the concept of /spl alpha/-shapes to polygonal meshes under the L/sub /spl infin// distance metric. We then generate valid triangulations to fill them using the intuitive notion of sweeping an L/sub /spl infin// cube over the identified regions.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The problem of topological simplification was also approached by El-Sana and Varshney using alpha shape inspired ideas of geometric growth.
“The problem of topological simplification was also approached by El-Sana and Varshney [5] using alpha shape inspired ideas of geometric growth.”
From Topological Persistence and Simplification (2002) · cites this paper as [5]
Cited by
Sorted by citations
Topological Persistence and Simplification
Edelsbrunner, Letscher, & Zomorodian (2002) · Discrete & Computational Geometry · doi:10.1007/s00454-002-2885-2 · Cited by 1,779 · see citing works
- Authors
- El-Sana, J., & Varshney, A.
- Affiliations
- Stony Brook University (US)
- ORCID
- Varshney, A.
- Venue
- IEEE Transactions on Visualization and Computer Graphics
- Published
- 1998
- Volume
- 4
- Issue
- 2
- Pages
- 133-144
- ISSN
- 1077-2626 (ISSN-L)
- OpenAlex
- W2157106620
- Cited by
- 58
- References
- 0
- Citations by year
- 2020: 1 · 2019: 1 · 2018: 1 · 2017: 2 · 2016: 1 · 2013: 1 · 2012: 5
- FWCI
- 4.74
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IEEE Transactions on Visualization and Computer Graphics (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Computer Graphics and Visualization Techniques
- Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Computational Geometry and Mesh Generation
- Physical Sciences › Engineering › Computational Mechanics › 3D Shape Modeling and Analysis
- Keywords
- polygonal meshes, crack repair, alpha shapes, L-infinity distance, hole detection, triangulation, virtual worlds
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review