Quadric-Based Simplification in Any Dimension

Garland, Michael; Zhou, YuanYuan

Permalink

https://hdl.handle.net/2142/10811 Copy

Description

Title

Quadric-Based Simplification in Any Dimension

Author(s)

• Garland, Michael
• Zhou, YuanYuan

Issue Date

2004-06

Keyword(s)

computer graphics

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 non-manifolds, and can preserve intricate boundaries.

Type of Resource

text

Permalink

http://hdl.handle.net/2142/10811

Copyright and License Information

You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the University of Illinois at Urbana-Champaign Computer Science Department under terms that include this permission. All other rights are reserved by the author(s).

Owning Collections