Quadric-based simplification in any dimension

  • Authors:
  • Michael Garland;Yuan Zhou

  • Affiliations:
  • University of Illinois at Urbana--Champaign, Urbana, IL;University of Illinois at Urbana--Champaign, Urbana, IL

  • Venue:
  • ACM Transactions on Graphics (TOG)
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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.