Progressive mesh color model generation algorithm based on quadratic error measure

quadratic error measurement;  progressive grid;  side folding;  Level of detail

The existing progressive mesh generation algorithms are not only inefficient, but also most of them can only complete the simplification of geometric features, and do not consider other surface properties of the mesh model. To solve these problems, a new algorithm is proposed. This algorithm generalizes the quadratic error measure based on the sum of squares of distances from points to a set of planes from three-dimensional geometric space to multidimensional space containing attribute information. This quadratic error measure indicates the degree of matching between the simplified mesh and the geometric characteristics and attribute information of the initial mesh, and uses the principle of minimal quadratic error value to guide the simplification operation of the mesh. Experimental results show that the algorithm not only has high efficiency, but also ensures that the simplified model has high similarity with the initial model in terms of geometric features and color information.