Affiliation:
1. University of Illinois at Urbana--Champaign, Urbana, IL
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design
Reference68 articles.
1. Strip trees: a hierarchical representation for curves
2. Baumgart B. G. 1974. Geometric modeling for computer vision. Ph.D. thesis CS Dept Stanford U. AIM-249 STAN-CS-74-463. Baumgart B. G. 1974. Geometric modeling for computer vision. Ph.D. thesis CS Dept Stanford U. AIM-249 STAN-CS-74-463.
3. Polygonal approximation by boundary reduction
4. Chopra P. and Meyer J. 2002. . . . An algorithm for rapid tetrahedral simplification. In IEEE Visualization 2003. 133--140. Chopra P. and Meyer J. 2002. TetFusion: An algorithm for rapid tetrahedral simplification. In IEEE Visualization 2003. 133--140.
Cited by
68 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献