Approximated Centroidal Voronoi Diagrams for Uniform Polygonal Mesh Coarsening

Simple item page
dc.contributor.authorValette, Sebastienen_US
dc.contributor.authorChassery, Jean-Marcen_US
dc.date.accessioned2015-02-19T09:54:11Z
dc.date.available2015-02-19T09:54:11Z
dc.date.issued2004en_US
dc.description.abstractWe 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.en_US
dc.description.number3en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume23en_US
dc.identifier.doi10.1111/j.1467-8659.2004.00769.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages381-389en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2004.00769.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing, Incen_US
dc.titleApproximated Centroidal Voronoi Diagrams for Uniform Polygonal Mesh Coarseningen_US
Files
Collections
23-Issue 3