The DOI matches its Crossref record; 45 of the 45 references it cites were found in a registry or an index.
Centroidal Voronoi Tessellations: Applications and Algorithms
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 methodsfor 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
(1967) · Cited by 23,719
Least squares quantization in PCM
Lloyd, S. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056489 · Cited by 15,836
Algorithm AS 136: A K-Means Clustering Algorithm
Hartigan, J. A., & Wong, M. A. (1979) · Applied Statistics · doi:10.2307/2346830 · Cited by 14,523
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
An Algorithm for Vector Quantizer Design
Linde, Y., Buzo, A., & Gray, R. (1980) · IEEE Transactions on Communications · doi:10.1109/tcom.1980.1094577 · Cited by 7,201
Vector Quantization and Signal Compression
Gersho, A., & Gray, R. M. (1992) · Springer eBooks · doi:10.1007/978-1-4615-3626-0 · Cited by 7,003
Algorithms for clustering data
Flury, B. (1989) · Journal of Statistical Planning and Inference · doi:10.1016/0378-3758(89)90033-5 · Cited by 6,432
(1975) · CERN Document Server (European Organization for Nuclear Research) · Cited by 5,958
Combinatorial Optimization: Algorithms and Complexity.
Johnson, D. S., Papadimitriou, C. H., & Steiglitz, K. (1984) · The American Mathematical Monthly · doi:10.2307/2322374 · Cited by 5,942
Computational Geometry--An Introduction.
Atallah, M. J., Preparata, F. P., & Shamos, M. I. (1986) · Mathematics of Computation · doi:10.2307/2008200 · Cited by 4,238
Spatial Tessellations: Concepts and Applications of Voronoi Diagrams
Okabe, A., Boots, B. N., & Sugihara, K. (1992) · Cited by 3,546
Random Number Generation and Quasi-Monte Carlo Methods.
Collings, B. J., & Niederreiter, H. (1993) · Journal of the American Statistical Association · doi:10.2307/2290359 · Cited by 2,884
Random Number Generation and Quasi-Monte Carlo Methods
Niederreiter, H. (1992) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970081 · Cited by 2,770
Methods of Numerical Integration.
S., F., Davis, P. J., & Rabinowitz, P. (1986) · Mathematics of Computation · doi:10.2307/2008014 · Cited by 2,735
Gray, R. M., & Neuhoff, D. L. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720541 · Cited by 1,642
Huber, P. J. (1985) · The Annals of Statistics · doi:10.1214/aos/1176349519 · Cited by 1,277
K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
Selim, S. Z., & Ismail, M. A. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767478 · Cited by 1,212
Asymptotically optimal block quantization
Gersho, A. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1056067 · Cited by 863
Exploratory Projection Pursuit
Friedman, J. H. (1987) · Journal of the American Statistical Association · doi:10.1080/01621459.1987.10478427 · Cited by 794
A classification EM algorithm for clustering and two stochastic versions
Celeux, G., & Govaert, G. (1992) · Computational Statistics & Data Analysis · doi:10.1016/0167-9473(92)90042-e · Cited by 772
When Are Quasi-Monte Carlo Algorithms Efficient for High Dimensional Integrals?
Sloan, I. H., & Woźniakowski, H. (1998) · Journal of Complexity · doi:10.1006/jcom.1997.0463 · Cited by 606
Color image quantization for frame buffer display
Heckbert, P. (1982) · ACM SIGGRAPH Computer Graphics · doi:10.1145/965145.801294 · Cited by 549
Strong Consistency of $K$-Means Clustering
Pollard, D. (1981) · The Annals of Statistics · doi:10.1214/aos/1176345339 · Cited by 454
Inaba, M., Katoh, N., & Imai, H. (1994) · Proceedings of the tenth annual symposium on Computational geometry - SCG '94 · doi:10.1145/177424.178042 · Cited by 321
A Central Limit Theorem for $k$-Means Clustering
Pollard, D. (1982) · The Annals of Probability · doi:10.1214/aop/1176993713 · Cited by 240
Description of cellular patterns by Dirichlet domains: The two-dimensional case
Honda, H. (1978) · Journal of Theoretical Biology · doi:10.1016/0022-5193(78)90315-6 · Cited by 239
Geometrical Models for Cells in Tissues
Honda, H. (1983) · International Review of Cytology · doi:10.1016/s0074-7696(08)62339-6 · Cited by 211
Optimal adaptive k-means algorithm with dynamic adjustment of learning rate
Chinrungrueng, C., & Sequin, C. H. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.363440 · Cited by 206
The complexity of the generalized Lloyd - Max problem (Corresp.)
Garey, M., Johnson, D., & Witsenhausen, H. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056488 · Cited by 191
Application of weighted Voronoi diagrams and randomization to variance-based k-clustering
Inaba, M. (1994) · Annual Symposium on Computational Geometry (SoCG) · Cited by 189
Sheppard, W. F. (1897) · Proceedings of the London Mathematical Society · doi:10.1112/plms/s1-29.1.353 · Cited by 162
Clustering algorithms based on minimum and maximum spanning trees
Asano, T., Bhattacharya, B. K., Keil, M., & Yao, F. (1988) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/73393.73419 · Cited by 153
OptiSim: An Extended Dissimilarity Selection Method for Finding Diverse Representative Subsets
Clark, R. D. (1997) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci970282v · Cited by 140
Locally optimal block quantizer design
Gray, R. M., Kieffer, J. C., & Linde, Y. (1980) · Information and Control · doi:10.1016/s0019-9958(80)90313-7 · Cited by 136
Asymptotic Distributions for Clustering Criteria
Hartigan, J. A. (1978) · The Annals of Statistics · doi:10.1214/aos/1176344071 · Cited by 127
An algorithm for multidimensional data clustering
Wan, S. J., Wong, S. K. M., & Prusinkiewicz, P. (1988) · ACM Transactions on Mathematical Software · doi:10.1145/45054.45056 · Cited by 101
Barlow, G. W. (1974) · Animal Behaviour · doi:10.1016/0003-3472(74)90010-4 · Cited by 71
On the pattern of space division by territories
Hasegawa, M., & Tanemura, M. (1976) · Annals of the Institute of Statistical Mathematics · doi:10.1007/bf02504768 · Cited by 60
Convergence of Vector Quantizers with Applications to Optimal Quantization
Abaya, E. F., & Wise, G. L. (1984) · SIAM Journal on Applied Mathematics · doi:10.1137/0144013 · Cited by 52
The asymptotic efficiency of randomized nets for quadrature
Hickernell, F. J., & Hong, H. S. (1999) · Mathematics of Computation · doi:10.1090/s0025-5718-99-01019-4 · Cited by 31
Polynomial approximation and vector quantization: a region-based integration
Natale, F. G. B. D., Desoli, G. S., Giusto, D., & Vernazza, G. L. (1995) · IEEE Transactions on Communications · doi:10.1109/26.380036 · Cited by 24
Experimental results of randomized clustering algorithm
Inaba, M., Imai, H., & Katoh, N. (1996) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/237218.237406 · Cited by 14
The evaluation of multidimensional integrals
Cranley, R. (1968) · The Computer Journal · doi:10.1093/comjnl/11.1.102 · Cited by 7
Un algorithme de classification automatique non paramétrique
Denœux, T., & Govaert, G. (1997) · Comptes Rendus de l Académie des Sciences - Series I - Mathematics · doi:10.1016/s0764-4442(97)86988-1 · Cited by 1
Cited by
An efficient k-means clustering algorithm: analysis and implementation
Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silverman, R., & Wu, A. Y. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1017616 · Cited by 5,660
“Lloyd’s algorithm is based on the simple observation that the optimal placement of a center is at the centroid of the associated cluster (see [18], [15]).”
BackgroundCoverage Control for Mobile Sensing Networks
Cortes, J., Martinez, S., Karatas, T., & Bullo, F. (2004) · IEEE Transactions on Robotics and Automation · doi:10.1109/tra.2004.824698 · Cited by 2,710
Discrete Differential-Geometry Operators for Triangulated 2-Manifolds
Meyer, M., Desbrun, M., Schröder, P., & Barr, A. H. (2003) · Mathematics and Visualization · doi:10.1007/978-3-662-05105-4_2 · Cited by 1,889
TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator
Si, H. (2015) · ACM Transactions on Mathematical Software · doi:10.1145/2629697 · Cited by 1,573
Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms
Bullo, F., Cortés, J., & Martínez, S. (2009) · Princeton University Press eBooks · doi:10.1515/9781400831470 · Cited by 1,509
Metadata
- Authors
- Du, Q., Faber, V., & Gunzburger, M.
- Venue
- SIAM Review
- Published
- 1999-01
- Volume
- 41
- Issue
- 4
- Pages
- 637-676
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W2051752778
- Cited by
- 2,244
- References
- 45
- FWCI
- 14.00
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.