.png){kind=icon}
.png){kind=icon}
Return
Quadric-based simplification in any dimension
.png){kind=icon}
OA
AI
DOI：10.1145/1061347.1061350.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present a novel generalization of the quadric error metric used in surface simplification that can be used for simplifying simplicial complexes of any type embedded in Euclidean spaces of any dimension. We demonstrate that our generalized simplification system can produce high quality approximations of plane and space curves, triangulated surfaces, tetrahedralized volume data, and simplicial complexes of mixed type. Our method is both efficient and easy to implement. It is capable of processing complexes of arbitrary topology, including nonmanifolds, and can preserve intricate boundaries.
Keywords:
algorithms
quadric error metric
surface simplification
curve simplification
volume simplification
edge contraction
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.5
Papers:
4.7K
Citations:
3.6W
Organization
No organization information available