## Quadric-based simplification in any dimension (2005)

### Cached

### Download Links

- [mgarland.org]
- [graphics.cs.uiuc.edu]
- [mgarland.org]
- DBLP

### Other Repositories/Bibliography

Venue: | ACM Transactions on Graphics |

Citations: | 37 - 3 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.

### Citations

4142 |
Pattern Classification and Scene Analysis
- Duda, Hart
(Show Context)
Citation Context ...t until the approximation meets some termination criteria. This is evidently a rather natural algorithm for curve approximation, since it was independently invented by a number of people [Ramer 1972; =-=Duda and Hart 1973-=-; Douglas and Peucker 1973; Baumgart 1974; Turner 1974; Pavlidis 1977; Ballard 1981]. Hershberger and Snoeyink [1994] discuss the efficient implementation of the Douglas–Peucker algorithm, specificall... |

1179 | Progressive meshes
- Hoppe
- 1996
(Show Context)
Citation Context ...on [Hoppe et al. 1993]. Of the numerous algorithms developed since, many of the most effective have been based on iterative edge contraction. Particularly relevant methods include progressive meshes [=-=Hoppe 1996-=-], quadric-based simplification [Garland and Heckbert 1997], and memoryless simplification [Lindstrom and Turk 1998]. Since typical graphics applications use additional non-geometric surface attribute... |

1005 | Surface simplification using quadric error metrics
- Garland, Heckbert
- 1997
(Show Context)
Citation Context ...nguage, we have been able to produce a single templatized simplification code to handle all input types. At the heart of our approach is a novel generalization of the well-known quadric error metric [=-=Garland and Heckbert 1997-=-; Garland 1999b]. 2. BACKGROUND Unless noted otherwise, we assume that we are given a manifold simplicial complex M = (V, F ), composed of a set of d-simplices F and a set of vertices V embedded in th... |

754 |
Algebra and Its Applications
- Strang, Linear
- 1980
(Show Context)
Citation Context ... the error of this optimal point will be: Q(x ∗ ) = b T x ∗ + c = −b T A −1 b + c (10) Note that these are both instances of well-known formulae for the minimum of a positive definite quadratic form [=-=Strang 1988-=-, pg. 347]. In the case when A is singular, it can be advantageous to perform singular value decomposition so as to project vertices onto the solution space [Lindstrom 2000b]. However, in the context ... |

589 | Decimation of triangle meshes
- Schroeder, Zarge, et al.
- 1992
(Show Context)
Citation Context ...ification. The earliest general methods for the automatic simplification of triangulated surfaces were vertex clustering [Rossignac and Borrel 1993], surface re-tiling [Turk 1992], vertex decimation [=-=Schroeder et al. 1992-=-], and mesh optimization [Hoppe et al. 1993]. Of the numerous algorithms developed since, many of the most effective have been based on iterative edge contraction. Particularly relevant methods includ... |

512 |
Algorithms for the reduction of the number of points required to represent a digitized line or its caricature
- Douglas, Peucker
- 1973
(Show Context)
Citation Context ...ation meets some termination criteria. This is evidently a rather natural algorithm for curve approximation, since it was independently invented by a number of people [Ramer 1972; Duda and Hart 1973; =-=Douglas and Peucker 1973-=-; Baumgart 1974; Turner 1974; Pavlidis 1977; Ballard 1981]. Hershberger and Snoeyink [1994] discuss the efficient implementation of the Douglas–Peucker algorithm, specifically with an eye towards redu... |

438 | Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator
- Shewchuk
- 1996
(Show Context)
Citation Context ...tical). Consider again the model shown in Figure 1. This is a planar triangle mesh of the interior of Lake Superior and contains 2894 vertices. It was made with the Triangle mesh generation software [=-=Shewchuk 1996-=-]. As we can clearly see in Figure 1, the triangle aspect ratios of the simplified mesh are quite extreme. However, we can easily remedy this by adding an additional vertex distribution quadric of the... |

409 | Re-tiling polygonal surfaces
- TURK
- 1991
(Show Context)
Citation Context ...to our own. 2.1.1 Surface Simplification. The earliest general methods for the automatic simplification of triangulated surfaces were vertex clustering [Rossignac and Borrel 1993], surface re-tiling [=-=Turk 1992-=-], vertex decimation [Schroeder et al. 1992], and mesh optimization [Hoppe et al. 1993]. Of the numerous algorithms developed since, many of the most effective have been based on iterative edge contra... |

369 | H.: Discrete differential-geometry operators for triangulated 2-manifolds
- MEYER, DESBRUN, et al.
- 2003
(Show Context)
Citation Context ...nd yields little improvement in accuracy. It can also complicate our construction as the set of points closer to v than any other vertex may extend beyond its 1-ring in the presence of obtuse angles [=-=Meyer et al. 2003-=-]. Therefore, we adopt a much simpler approach. The fundamental quadric of a vertex is the weighted sum of the fundamental quadrics of the maximal simplices incident on it. Each simplex is divided equ... |

367 | Mesh optimization
- Hoppe
- 1993
(Show Context)
Citation Context ... automatic simplification of triangulated surfaces were vertex clustering [Rossignac and Borrel 1993], surface re-tiling [Turk 1992], vertex decimation [Schroeder et al. 1992], and mesh optimization [=-=Hoppe et al. 1993-=-]. Of the numerous algorithms developed since, many of the most effective have been based on iterative edge contraction. Particularly relevant methods include progressive meshes [Hoppe 1996], quadric-... |

315 |
Multi-resolution 3D approximations for rendering complex scenes
- Rossignac, Borrel
- 1993
(Show Context)
Citation Context ...section, we review only the work most relevant to our own. 2.1.1 Surface Simplification. The earliest general methods for the automatic simplification of triangulated surfaces were vertex clustering [=-=Rossignac and Borrel 1993-=-], surface re-tiling [Turk 1992], vertex decimation [Schroeder et al. 1992], and mesh optimization [Hoppe et al. 1993]. Of the numerous algorithms developed since, many of the most effective have been... |

287 | Metro: measuring error on simplified surfaces. Comput. Graphics Forum 17
- CIGNONI, ROCCHINI, et al.
- 1998
(Show Context)
Citation Context ... 2.1 Related Work Over the years, many methods have been developed for the automatic simplification of simplicial models. Details on many of them can be found in one of a number of available surveys [=-=Cignoni et al. 1998-=-; Garland 1999a; Luebke et al. 2002]. In this section, we review only the work most relevant to our own. 2.1.1 Surface Simplification. The earliest general methods for the automatic simplification of ... |

212 |
Level of Detail for 3D Graphics
- Luebke, Watson, et al.
- 2002
(Show Context)
Citation Context ...ny methods have been developed for the automatic simplification of simplicial models. Details on many of them can be found in one of a number of available surveys [Cignoni et al. 1998; Garland 1999a; =-=Luebke et al. 2002-=-]. In this section, we review only the work most relevant to our own. 2.1.1 Surface Simplification. The earliest general methods for the automatic simplification of triangulated surfaces were vertex c... |

207 | Dual contouring of hermite data - JU, LOSASSO, et al. |

206 | Survey of polygonal surface simplification algorithms - Heckbert, Garland - 1997 |

182 | Simplifying surfaces with color and texture using quadric error metrics - Garland, Heckbert - 1998 |

180 | Simplification envelopes
- Cohen, Varshney, et al.
- 1996
(Show Context)
Citation Context ...rantee that self-intersections are never created. In such cases, it is best to couple iterative contraction methods with envelope methods. In particular, we recommend either simplification envelopes [=-=Cohen et al. 1996-=-] or permission grids [Zelinka and Garland 2002]. 4. STANDARD ERROR METRIC We begin by briefly reviewing the derivation of the standard quadric error metric for triangulated 2-manifolds [Garland and H... |

161 | Progressive Simplicial Complexes
- Popović, Hoppe
- 1997
(Show Context)
Citation Context ...faces, and tetrahedralized volumes. However, comparatively little effort has been directed towards algorithmic techniques that can successfully simplify all such data. And with one notable exception [=-=Popović and Hoppe 1997-=-], the problem of simplifying objects of mixed dimension (e.g., containing both lines and triangles) has remained unaddressed. In this paper, we present a new simplification method that can produce ap... |

150 | A Comparison of Mesh Simplification Algorithms
- Cignoni, Montani, et al.
- 1998
(Show Context)
Citation Context ... 2.1 Related Work Over the years, many methods have been developed for the automatic simplification of simplicial models. Details on many of them can be found in one of a number of available surveys [=-=Cignoni et al. 1998-=-; Garland 1999a; Luebke et al. 2002]. In this section, we review only the work most relevant to our own. 2.1.1 Surface Simplification. The earliest general methods for the automatic simplification of ... |

145 | Appearance-Preserving Simplification - Cohen, Olano, et al. - 1998 |

141 | Fast and memory efficient polygonal simplification
- Lindstrom, Turk
- 1998
(Show Context)
Citation Context ...en based on iterative edge contraction. Particularly relevant methods include progressive meshes [Hoppe 1996], quadric-based simplification [Garland and Heckbert 1997], and memoryless simplification [=-=Lindstrom and Turk 1998-=-]. Since typical graphics applications use additional non-geometric surface attributes, especially color and texture, methods have also been developed for preserving these attributes during the simpli... |

139 |
Structural Pattern Recognition
- Pavlidis
- 1977
(Show Context)
Citation Context ...ly a rather natural algorithm for curve approximation, since it was independently invented by a number of people [Ramer 1972; Duda and Hart 1973; Douglas and Peucker 1973; Baumgart 1974; Turner 1974; =-=Pavlidis 1977-=-; Ballard 1981]. Hershberger and Snoeyink [1994] discuss the efficient implementation of the Douglas–Peucker algorithm, specifically with an eye towards reducing its worst case complexity. Decimation ... |

138 |
Geometric Modelling for Computer Vision
- Baumgart
- 1974
(Show Context)
Citation Context ...on criteria. This is evidently a rather natural algorithm for curve approximation, since it was independently invented by a number of people [Ramer 1972; Duda and Hart 1973; Douglas and Peucker 1973; =-=Baumgart 1974-=-; Turner 1974; Pavlidis 1977; Ballard 1981]. Hershberger and Snoeyink [1994] discuss the efficient implementation of the Douglas–Peucker algorithm, specifically with an eye towards reducing its worst ... |

138 |
Fullrange approximation of triangulated polyhedra
- RONFARD, ROSSIGNAC, et al.
- 1996
(Show Context)
Citation Context ...ximations. Preventing inversion by explicit orientation checks is quite common. It has been used for planar graphs [Ciarlet and Lamour 1996], triangular meshes [Garland and Heckbert 1997; Hoppe 1996; =-=Ronfard and Rossignac 1996-=-], and tetrahedral volumes [Staadt and Gross 1998; Gelder et al. 1999; Trotts et al. 1999; Cignoni et al. 2000; Chopra and Meyer 2002]. In our quadric-based system, it is in planar regions where mesh ... |

137 | Out-of-core simplification of large polygonal models - Lindstrom - 2000 |

126 | Multiresolution modeling: Survey & future opportunities
- Garland
- 1999
(Show Context)
Citation Context ...o produce a single templatized simplification code to handle all input types. At the heart of our approach is a novel generalization of the well-known quadric error metric [Garland and Heckbert 1997; =-=Garland 1999-=-b]. 2. BACKGROUND Unless noted otherwise, we assume that we are given a manifold simplicial complex M = (V, F ), composed of a set of d-simplices F and a set of vertices V embedded in the Euclidean sp... |

120 |
An iterative procedure for the polygonal approximation of plane curves
- Ramer
- 1972
(Show Context)
Citation Context ...rsively split until the approximation meets some termination criteria. This is evidently a rather natural algorithm for curve approximation, since it was independently invented by a number of people [=-=Ramer 1972-=-; Duda and Hart 1973; Douglas and Peucker 1973; Baumgart 1974; Turner 1974; Pavlidis 1977; Ballard 1981]. Hershberger and Snoeyink [1994] discuss the efficient implementation of the Douglas–Peucker al... |

103 | New quadric metric for simplifying meshes with appearance attributes
- Hoppe
- 1999
(Show Context)
Citation Context ...r the kinds of data encountered in practice, this is not a problem, but it would be useful to explore the possibility of generalizing Hoppe’s scheme for reducing the number of necessary coefficients [=-=Hoppe 1999-=-]. Even more dramatic memory reduction could be achieved by implementing a multiphase system [Garland and Shaffer 2002] built on top of our generalized metric. Both the standard quadric metric and our... |

94 | Surface approximation and geometric partitions
- Agarwal, Suri
- 1998
(Show Context)
Citation Context ...6; Cignoni et al. 1998]. All existing surface simplification are fundamentally heuristic in nature. Optimal height field approximation, and by extension surface approximation, is known to be NP-Hard [=-=Agarwal and Suri 1994-=-]. However, Heckbert and Garland [1999] have shown that, in the limit of infinitesimal triangulations, their quadric-based method produces triangles with the optimal aspect ratio required for L2-optim... |

93 | Multiresolution decimation based on global error
- Ciampalini, Cignoni, et al.
- 1996
(Show Context)
Citation Context ...n levels, it also produces the best results. The next two algorithms below mesh optimization are the the simplification envelopes algorithm [Cohen et al. 1996], and the JADE vertex decimation system [=-=Ciampalini et al. 1997-=-]. By comparison to mesh optimization, these algorithms provide a significant savings in running time, but produce approximations with higher error at higher levels of simplification. The final two al... |

83 | Quadric-based Polygonal Surface Simplification
- Garland
- 1998
(Show Context)
Citation Context ...lation; they do not enforce the strict angle guarantees provided by Triangle. Positional error terms of this sort are quite natural and have been previously proposed in a number of contexts. Garland [=-=Garland 1999-=-b] recommended their use for preserving important feature points (e.g., the tips of horns) and they are a key component of the user-guided simplification system of Kho and Garland [2003]. Lindstrom [L... |

68 | Topology preserving edge contraction - DEY, EDELSBRUNNER, et al. - 1999 |

64 | Progressive tetrahedralizations
- STAADT, GROSS
- 1998
(Show Context)
Citation Context ...n checks is quite common. It has been used for planar graphs [Ciarlet and Lamour 1996], triangular meshes [Garland and Heckbert 1997; Hoppe 1996; Ronfard and Rossignac 1996], and tetrahedral volumes [=-=Staadt and Gross 1998-=-; Gelder et al. 1999; Trotts et al. 1999; Cignoni et al. 2000; Chopra and Meyer 2002]. In our quadric-based system, it is in planar regions where mesh inversions are most likely to occur. Figure 1 dem... |

61 |
Strip trees: A hierarchical representation for curves
- BALLARD
- 1981
(Show Context)
Citation Context ...ural algorithm for curve approximation, since it was independently invented by a number of people [Ramer 1972; Duda and Hart 1973; Douglas and Peucker 1973; Baumgart 1974; Turner 1974; Pavlidis 1977; =-=Ballard 1981-=-]. Hershberger and Snoeyink [1994] discuss the efficient implementation of the Douglas–Peucker algorithm, specifically with an eye towards reducing its worst case complexity. Decimation algorithms, wh... |

60 | Surface simplification with variable tolerance - Guéziec - 1995 |

54 | Optimal triangulation and quadric-based surface simplification - HECKBERT, GARLAND - 1999 |

54 |
A texture-mapping approach for the compression of colored 3D triangulations
- Soucy, Godin, et al.
- 1996
(Show Context)
Citation Context ...ocused on minimizing parametric distortion during simplification. Others have pursued solutions based on resampling of attributes from the original surface onto the output approximation [Maruya 1995; =-=Soucy et al. 1996-=-; Cignoni et al. 1998]. All existing surface simplification are fundamentally heuristic in nature. Optimal height field approximation, and by extension surface approximation, is known to be NP-Hard [A... |

53 | Simplification of Tetrahedral Meshes with Accurate Error Evalution
- Cignoni, Costanza, et al.
- 2000
(Show Context)
Citation Context ...iarlet and Lamour 1996], triangular meshes [Garland and Heckbert 1997; Hoppe 1996; Ronfard and Rossignac 1996], and tetrahedral volumes [Staadt and Gross 1998; Gelder et al. 1999; Trotts et al. 1999; =-=Cignoni et al. 2000-=-; Chopra and Meyer 2002]. In our quadric-based system, it is in planar regions where mesh inversions are most likely to occur. Figure 1 demonstrates what can happen if mesh inversions are not prevente... |

51 |
On the difficulty of triangulating three-dimensional nonconvex polyhedra
- Ruppert, Seidel
- 1992
(Show Context)
Citation Context ... by the fact that the hole left by a vertex removal is not necessarily tetrahedralizable without adding Steiner Technical Report No. UIUCDCS-R-2004-2450, June 2004.s4 · M. Garland and Y. Zhou points [=-=Ruppert and Seidel 1992-=-]. Van Gelder et al. [1999] implemented vertex removal via half-edge contractions and suggested a local density metric to guide the selection of vertices to remove. Trotts et al. [1998; 1999], Cignoni... |

48 | Efficient adaptive simplification of massive meshes
- SHAFFER, GARLAND
(Show Context)
Citation Context ... along the way. Fortunately, our generalized metric is equivalent in form to the standard quadric error metric. Therefore, it can trivially form the basis of an efficient clustering [Lindstrom 2000b; =-=Shaffer and Garland 2001-=-] or multiphase [Garland and Shaffer 2002] simplification system. 8.3 Implementation We believe that one of the great strengths of our error formulation is its uniformity. A single simple summation (E... |

40 | Surface simplification inside a tolerance volume - Guéziec - 1996 |

38 | Simplification of tetrahedral meshes - TROTTS, HAMANN, et al. - 1998 |

37 | A general method for preserving attribute values on simplified meshes
- Cignoni, Montani, et al.
- 1998
(Show Context)
Citation Context ... 2.1 Related Work Over the years, many methods have been developed for the automatic simplification of simplicial models. Details on many of them can be found in one of a number of available surveys [=-=Cignoni et al. 1998-=-; Garland 1999a; Luebke et al. 2002]. In this section, we review only the work most relevant to our own. 2.1.1 Surface Simplification. The earliest general methods for the automatic simplification of ... |

34 | Polygonal Approximation of a curve - formulations and algorithms - Imai, MIri - 1988 |

34 |
Simplification of tetrahedral meshes with error bounds
- Trotts, Hamann, et al.
- 1999
(Show Context)
Citation Context ...for planar graphs [Ciarlet and Lamour 1996], triangular meshes [Garland and Heckbert 1997; Hoppe 1996; Ronfard and Rossignac 1996], and tetrahedral volumes [Staadt and Gross 1998; Gelder et al. 1999; =-=Trotts et al. 1999-=-; Cignoni et al. 2000; Chopra and Meyer 2002]. In our quadric-based system, it is in planar regions where mesh inversions are most likely to occur. Figure 1 demonstrates what can happen if mesh invers... |

33 | Selective refinement queries for volume visualization of unstructured tetrahedral meshes - Cignoni, Floriani, et al. - 2004 |

31 | Modeling realistic virtual hairstyles - YU |

30 | GAPS: General and Automatic Polygonal Simplification - Erikson, Manocha - 1999 |

28 |
A multiphase approach to efficient surface simplification
- GARLAND, SHAFFER
(Show Context)
Citation Context ...zed metric is equivalent in form to the standard quadric error metric. Therefore, it can trivially form the basis of an efficient clustering [Lindstrom 2000b; Shaffer and Garland 2001] or multiphase [=-=Garland and Shaffer 2002-=-] simplification system. 8.3 Implementation We believe that one of the great strengths of our error formulation is its uniformity. A single simple summation (Equation 15) is used to construct quadrics... |

27 | Optimal triangular mesh generation by coordinate transformation - D’Azevedo - 1991 |