Surface Simplification Using Quadric Error Metrics

DMCA

Surface Simplification Using Quadric Error Metrics

Cached

Download Links

by Michael Garland , Paul S. Heckbert

Citations:

1174 - 16 self

BibTeX

@MISC{Garland_surfacesimplification,
    author = {Michael Garland and Paul S. Heckbert},
    title = { Surface Simplification Using Quadric Error Metrics},
    year = {}
}

OpenURL

Abstract

Many applications in computer graphics require complex, highly detailed models. However, the level of detail actually necessary may vary considerably. To control processing time, it is often desirable to use approximations in place of excessively detailed models. We have developed a surface simplification algorithm which can rapidly produce high quality approximations of polygonal models. The algorithm uses iterative contractions of vertex pairs to simplify models and maintains surface error approximations using quadric matrices. By contracting arbitrary vertex pairs (not just edges), our algorithm is able to join unconnected regions of models. This can facilitate much better approximations, both visually and with respect to geometric error. In order to allow topological joining, our system also supports non-manifold surface models.

Keyphrases

detailed model high quality approximation surface simplification error approximation vertex pair topological joining many application algorithm us iterative contraction arbitrary vertex pair processing time quadric matrix unconnected region computer graphic polygonal model non-manifold surface model

DMCA