Simplifying surfaces with color and texture using quadric error metrics

By Michael Garland, Paul S. Heckbert. 1998

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Occupancy Networks: Learning 3D Reconstruction in Function Space (2018, methodology): “In a ﬁrst step, we simplify the mesh using the Fast-Quadric-Mesh-Simpliﬁcation algo-rithm 3 [20].”
Simplification and Repair of Polygonal Models Using Volumetric Techniques (2003, methodology): “In this step, we use Garland and Heckbert's newer simplification method that preserves the color of the original surface [9].”
A Probabilistic On-Line Mapping Algorithm for Teams of Mobile Robots (2001, methodology): “To simplify the maps, the polygons are fused by a software package developed by computer graphics researchers (Garland and Heckbert 1997, 1998).”
Anisotropic polygonal remeshing (2003, background): “Heckbert and Garland [1999] made an interesting link between the quadric error metric used in their mesh simplification [Garland and Heckbert 1998] and its asymptotic behavior on finely tessellated surfaces.”
Dual contouring of hermite data (2002, unknown): “Note that the residual associated with the minimizer of this QEF estimates how well the minimizing vertex approximates the original geometry [Garland and Heckbert 1998].”
Interactive geometry remeshing (2002, background): “The majority of previous work has proposed semi-regular remeshing techniques [24, 20, 21, 22], based on an initial phase of simplification which could be used in itself for remeshing [14, 27] since it performs the aforementioned edge operations and vertex shifting.”
Skinning mesh animations (2005, methodology): “Mesh levels of detail are produced using mesh simplification with additional vertex attributes [Garland and Heckbert 1998] for skinning weights, displacement corrections, PRT coefficients, etc.”