Decimation of Triangle Meshes Fab Central（减少三角形网格工厂中央）.pdf

Decimation of Triangle Meshes William J. Schroeder Jonathan A. Zarge William E. Lorensen General Electric Company Schenectady, NY 1.0 INTRODUCTION process and its implementation. Results from two differ- ent geometric modeling applications illustrate the The polygon remains a popular graphics primitive for strengths of the algorithm. computer graphics application. Besides having a simple representation, computer rendering of polygons is widely 2.0 THE DECIMATION ALGORITHM supported by commercial graphics hardware and software. However, because the polygon is linear, often thousands The goal of the decimation algorithm is to reduce the or millions of primitives are required to capture the details total number of triangles in a triangle mesh, preserving of complex geometry. Models of this size are generally the original topology and a good approximation to the not practical since rendering speeds and memory require- original geometry. ments are proportional to the number of polygons. Conse- quently applications that generate large polygonal meshes 2.1 OVERVIEW often use domain-specific knowledge to reduce model size. There remain algorithms, however, where domain- The decimation algorithm is simple. Multiple passes are specific reduction techniques are not generally available made over all vertices in the mesh. During a pass, each or appropriate.