Uniform remeshing of 3D meshes of arbitrary topology using discrete constrained centroid voronoi clustering

In this paper we propose a remeshing algorithm for altering the mesh geometry and connectivity of a 3D model to improve its uniformality. The new remeshing algorithm replaces an arbitrarily structured 3D mesh with a uniformly structured one, which has a given number of vertices, while approximates the original input mesh well. This is done through an elegant and efficient mesh clustering algorithm, which divides the faces of an input mesh into a given number of clusters for remeshing purpose by approximating the Centroidal Voronoi Tessellation of the mesh. With proliferation of 3D scanners, this remeshing algorithm is particularly useful for reverse engineering applications of 3D models, which in many cases are dense, nonuniform, irregular and arbitrary topology. Examples demonstrating effectiveness of the new algorithm are also included in the paper. Copyright ISCA.