Quadric-based simplification in any dimension
Michael Garland, Yuan Zhou
In ACM Transactions on Graphics, 24(2), April 2005.
Abstract: 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.
Keyword(s): Quadric error metric, curve simplification, edge contraction, surfacesimplification, volume simplification
Article URL: http://doi.acm.org/10.1145/1061347.1061350
BibTeX format:
@article{Garland:2005:QSI,
  author = {Michael Garland and Yuan Zhou},
  title = {Quadric-based simplification in any dimension},
  journal = {ACM Transactions on Graphics},
  volume = {24},
  number = {2},
  pages = {209--239},
  month = apr,
  year = {2005},
}
Search for more articles by Michael Garland.
Search for more articles by Yuan Zhou.

Return to the search page.


graphbib: Powered by "bibsql" and "SQLite3."