Surface Simplification Using Quadric Error Metrics：（表面简化使用二次误差度量）.pdfVIP

Surface Simplification Using Quadric Error Metrics Michael Garland∗ Paul S. Heckbert† Carnegie Mellon University Abstract We have developed an algorithm which produces simplified ver- sions of such polygonal models. Our algorithm is based on the iter- Many applications in computer graphics require complex, highly ative contraction of vertex pairs (a generalization of edge contrac- detailed models. However, the level of detail actually necessary tion). As the algorithm proceeds, a geometric error approximation may vary considerably. To control processing time, it is often desir- is maintained at each vertex of the current model. This error approx- able to use approximations in place of excessively detailed models. imation is represented using quadric matrices. The primary advan- We have developed a surface simplification algorithm which can tages of our algorithm are: rapidly produce high quality approximations of polygonal models. • Efficiency: The algorithm is able to simplify complex models The algorithm uses iterative contractions of vertex pairs to simplify quite rapidly. For example, our implementation can create a models and maintains surface error approximations using quadric 100 face approximation of a 70,000 face model in 15 seconds. matrices. By contracting arbitrary vertex pairs (not just edges), our The error approximation is also very compact, requiring only algorithm is able to join unconnected regions of models. This can 10 floati