Key points are not available for this paper at this time.
There are a variety of application areas in which there is a need for simplifying complex polygonal surface models. These models often have material properties such as colors, textures, and surface normals. Our surface simplification algorithm, based on iterative edge contraction and quadric error metrics, can rapidly produce high quality approximations of such models. We present a natural extension of our original error metric that can account for a wide range of vertex attributes.
Building similarity graph...
Analyzing shared references across papers
Loading...
Garland et al. (Thu,) studied this question.
synapsesocial.com/papers/69d909f75e21d3d3009f5610 — DOI: https://doi.org/10.1109/visual.1998.745312
Michael Garland
Nvidia (United Kingdom)
Paul S. Heckbert
Carnegie Mellon University
Carnegie Mellon University
Building similarity graph...
Analyzing shared references across papers
Loading...