Quadric-based simplification in any dimension (2005)
| Venue: | ACM Transactions on Graphics |
| Citations: | 27 - 2 self |
BibTeX
@ARTICLE{Garland05quadric-basedsimplification,
author = {Michael Garland and Yuan Zhou},
title = {Quadric-based simplification in any dimension},
journal = {ACM Transactions on Graphics},
year = {2005},
volume = {24},
pages = {209--239}
}
OpenURL
Abstract
We present a new method for simplifying simplicial complexes of any type embedded in Euclidean spaces of any dimension. At the heart of this system is a novel generalization of the quadric error metric used in surface simplification. 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.







