Triangular Mesh Simplification Based on Bounded Error

Abstract

The author proposed a triangular mesh simplification algorithm with the methodology of vertex culling, which is based on bounded error. The algorithm includes several steps as follow. Firstly, the algorithm arrays the vertex according to the curvature. The curvature of local area around one vertex reduces in the array. Secondly, for one vertex to be deleted, the bounding box’s height of the local area will be calculated. And the reduction of the bounding box’s height is controlled as restraint of vertex culling. After the vertex culling, triangular mesh reconstruction is conducted on polygon to fill up the hollows formed in the above steps. This algorithm well balanced the deletion rate and deletion error in the experiment.