2004/08/16 by Sébastien Valette, Jean‐Marc Chassery
Computer Science · Engineering · #3D Shape Modeling and Analysis #Computational Geometry and Mesh Generation #Computer Graphics and Visualization Techniques
paper · doi:10.1111/j.1467-8659.2004.00769.x
openalex publication_date 2004/08/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/30
Abstract We present a novel clustering algorithm for polygonal meshes which approximates a Centroidal Voronoi Diagram construction. The clustering provides an efficient way to construct uniform tessellations, and therefore leads to uniform coarsening of polygonal meshes, when the output triangulation has many fewer elements than the input mesh. The mesh topology is also simplified by the clustering algorithm. Based on a mathematical framework, our algorithm is easy to implement, and has low memory requirements. We demonstrate the efficiency of the proposed scheme by processing several reference meshes having up to 1 million triangles and very high genus within a few minutes on a low‐ end computer.