Approximated Centroidal Voronoi Diagrams for Uniform Polygonal Mesh Coarsening
No Thumbnail Available
Date
2004
Journal Title
Journal ISSN
Volume Title
Publisher
The Eurographics Association and Blackwell Publishing, Inc
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.
Description
@article{10.1111:j.1467-8659.2004.00769.x,
journal = {Computer Graphics Forum},
title = {{Approximated Centroidal Voronoi Diagrams for Uniform Polygonal Mesh Coarsening}},
author = {Valette, Sebastien and Chassery, Jean-Marc},
year = {2004},
publisher = {The Eurographics Association and Blackwell Publishing, Inc},
ISSN = {1467-8659},
DOI = {10.1111/j.1467-8659.2004.00769.x}
}