Centroidal Voronoi Tessellations: Applications and Algorithms
- 1 January 1999
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Review
- Vol. 41 (4) , 637-676
- https://doi.org/10.1137/s0036144599352836
Abstract
A centroidal Voronoi tessellation is a Voronoi tessellation whose generating points are the centroids (centers of mass) of the corresponding Voronoi regions. We give some applications of such tessellations to problems in image compression, quadrature, finite difference methods, distribution of resources, cellular biology, statistics, and the territorial behavior of animals. We discuss methods for computing these tessellations, provide some analyses concerning both the tessellations and the methods for their determination, and, finally, present the results of some numerical experiments.Keywords
This publication has 40 references indexed in Scilit:
- OptiSim: An Extended Dissimilarity Selection Method for Finding Diverse Representative SubsetsJournal of Chemical Information and Computer Sciences, 1997
- Polynomial approximation and vector quantization: a region-based integrationIEEE Transactions on Communications, 1995
- Optimal adaptive k-means algorithm with dynamic adjustment of learning rateIEEE Transactions on Neural Networks, 1995
- A classification EM algorithm for clustering and two stochastic versionsComputational Statistics & Data Analysis, 1992
- Exploratory Projection PursuitJournal of the American Statistical Association, 1987
- Convergence of Vector Quantizers with Applications to Optimal QuantizationSIAM Journal on Applied Mathematics, 1984
- The complexity of the generalized Lloyd - Max problem (Corresp.)IEEE Transactions on Information Theory, 1982
- Locally optimal block quantizer designInformation and Control, 1980
- Asymptotically optimal block quantizationIEEE Transactions on Information Theory, 1979
- Hexagonal territoriesAnimal Behaviour, 1974