Mesh simplification based on quadric error metrics

Mesh simplification can efficiently improve the processing speed of complex 3D models by computer. Mesh simplification requires low time and space complexity, high quality and triangularity compactness. A new algorithm to simplify dense meshes is presented. The algorithm uses edge collapse and error metrics based on squared distances from vertex to associated lines. To reduce the memory consumption, it keeps one float number for each vertex as the history record of the simplification. Examples running on a P I machine show that the algorithm can simplify a model containing 7 ×10⁴ triangles in 12 s, and the number of triangles whose compactnesses are greater than 0. 9 in simplified models is 56%.