Centroidal Voronoi tessellations: Applications and algorithms

SIAM Review

Volumn 41, Issue 4, 1999, Pages 637-676

  Du, Qiang ^a,b   Faber, Vance ^c,d   Gunzburger, Max ^a  

^a IOWA STATE UNIVERSITY   (United States)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^c LOS ALAMOS NATIONAL LABORATORY   (United States)

^d LizardTech Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FINITE DIFFERENCE METHOD; STATISTICS; VECTOR QUANTIZATION;

CENTROIDAL VORONOI TESSELLATIONS;

COMPUTATIONAL GEOMETRY;

EID: 0033317391     PISSN: 00361445     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0036144599352836     Document Type: Article

References (64)

1. E. ABAYA AND F. WISE, Convergence of vector quantizers with applications to optimal quantization, SIAM J. Appl. Math., 44 (1984), pp. 183-189.
2. T. ASANO, B. BHATTACHARYA, M. KEIL, AND F. YAO, Clustering algorithms based on minimum and maximum spanning trees, in Proceedings of the Fourth Annual Symposium on Computational Geometry, University of Illinois, Urbana, 1988, pp. 252-257.
3. G. BARLOW, Hexagonal territories, Animal Behav., 22 (1974), pp. 876-878.
4. G. CELEUX AND G. GOVAERT, A classification EM algorithm for clustering and two stochastic versions, Comput. Statist. Data. Anal., 14 (1992), pp. 315-332.
5. C. CHINRUNGRUENG AND C. SEQUIN, Optimal adaptive k-means algorithm with dynamic adjustment of learning rate, IEEE Trans. Neural Net., 6 (1995), pp. 157-169).
6. R. CLARK, Optisim - An extended, dissimilarity selection method for finding diverse representative, subsets, J. Chem. Inform. Comput. Sci., 37 (1997), pp. 1181-1188.
7. P. DAVIS AND P. RABINOWITZ, Methods of Numerical Integration, 2nd ed., Academic Press, New York, 1984.
8. F. DENATALE, G. DESOLI, D. GIUSTO, AND G. VERNAZZA, Polynomial approximation and vector quantization - A region-based integration, IEEE Trans. Comm., 43 (1995), pp. 198-206.
9. P. EISEMAN, Adaptive grid generation, Comput. Methods Appl. Mech. Engrg., 64 (1987), pp. 321-376.
10. R. ENGLAND AND D. BENYON, A remark on Algorithm AS136: k-means clustering algorithm, Appl. Statist., 30 (1981), pp. 355-356.
11. J. FRIEDMAN, Exploratory projection pursuit, J. Amer. Statist. Assoc., 82 (1987), pp. 249-266.
12. M. GARY AND D. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
13. M. GAREY, D. JOHNSON, AND H. WITSENHAUSEN, The complexity of the generalized Lloyd-Max problem, IEEE Trans. Inform. Theory, 28 (1982), pp. 255-256.
14. A. GERSHO, Asymptotically optimal block quantization, IEEE Trans. Inform. Theory, 25 (1979), pp. 373-380.
15. A. GERSHO AND R. GRAY, Vector Quantization and Signal Compression, Kluwer, Boston, 1992.
16. R. GRAY, J. KIEFFER, AND Y. LINDE, Locally optimal block quantizer design, Inform. and Control, 45 (1980), pp. 178-198.
17. R. GRAY AND D. NEUHOFF, Quantization, IEEE Trans. Inform. Theory, 44 (1998), pp. 2325-2383.
18. P. HALL, On polynomial-based projection indices for exploratory projection pursuit, Ann. Statist., 17 (1989), pp. 589-605.
19. J. HARTIGAN, Clustering Algorithms, Wiley-Interscience, New York, 1975.
20. J. HARTIGAN, Asymptotic distribution for clustering centers, Ann. Statist., 6 (1978), pp. 117-131.
21. J. HARTIGAN AND M. WONG, A k-means clustering algorithm, Appl. Statist. 28 (1979), pp. 100-108.
22. M. HASEGAWA AND M. TANEMURA, On the pattern of space division by territories, Ann. Inst. Statist. Math., 28 (1976), pp. 509-519.
23. M. HASEGAWA AND M. TANEMURA, Spatial patterns of territories, Recent Developments in Statistical Inference and Data Analysis, K. Matusita, ed., North Holland, Amsterdam, 1980, pp. 73-78.
24. S. HASEGAWA, H. IMAI, M. INABA, N. KATOH, AND J. NAKANO, Efficient algorithms for variance-based k-clustering, in Proceedings of the First Pacific Conference on Computer Graphics and Applications, World Scientific, River Edge, NJ, 1993, pp. 75-89.
25. P. HECKERT, Color image quantization frame buffer display, ACM Trans. Comput. Graph., 16 (1982), pp. 297-304.
26. F. HICKERNELL AND H. HONG, The asymptotic efficiency of randomized nets for quadrature, Math. Comp., 68 (1999), pp. 767-791.
27. H. HONDA, Description of cellular patterns by Dirichlet domains: The two-dimensional case, J. Theoret. Biol., 72 (1978), pp. 523-543.
28. H. HONDA, Geometrical modelling for cells in tissues, Inter. Rev. Cytol., 81 (1983), pp. 191-248.
29. P. HUBER, Projection pursuit, with discussion, Ann. Statist., 13 (1985), pp. 435-525.
30. H. IMAI AND M. INABA, Geometric k-clustering with applications, in Proceedings of the Third International Congress of Industrial and Applied Mathematics, 1995, to appear.
31. H. IMAI, N. KATOH, AND M. INABA, Applications of weighted Voronoi diagrams and randomization to variance-based k-clustering, Proceedings of the 10th ACM Symposium on Computational Geometry, 1994, pp. 332-339.
32. M. INABA, H. IMAI, AND N. KATOH, Experimental results of randomized clustering algorithms, in Proceedings of the 12th ACM Symposium on Computational Geometry: Communication Section, 1996, to appear.
33. M. IRI, K. MUROTA, AND T. OHYA, A fast Voronoi-diagram algorithm with applications to geographical optimization problems, in Proceedings of the 11th IFIP Conference on System Modelling and Optimzation, Lecture Notes in Control and Inform. Sci. 59, Springer-Verlag, New York, pp. 273-288.
34. A. JAIN AND R. DUBES, Algorithms for Clustering Data, Prentice-Hall, Englewood Cliffs, NJ, 1998.
35. M. JHUN, Bootstrapping k-means clustering, J. Japanese Soc. Comput. Statist., 3 (1990), pp. 1-14.
36. J. KIEFFER, Uniqueness of locally optimal quantizer for log-concave density and convex error function, IEEE Trans. Inform. Theory, 29 (1983), pp. 42-47.
37. R. KLEIN, Concrete and Abstract Voronoi Diagrams, Lecture Notes in Comput. Sci. 400, Springer, New York, 1989.
38. Y. LINDE, A. BUZO, AND R. GRAY, An algorithm for vector quantizer design, IEEE Trans. Comm., 28 (1980), pp. 84-95.
39. S. LLOYD, Least square quantization in PCM, IEEE Trans. Inform. Theory, 28 (1982), pp. 129-137.
40. J. MACQUEEN, Some methods for classification and analysis of multivariate observations, in Proceedings, Fifth Berkeley Symposium on Mathematical Statistics and Probability, Vol. I, L. Le Cam and J. Neyman, eds., University of California, Berkeley, 1967, pp. 281-297.
41. D. MCRAE AND K. LAFLIN, Dynamic grid adaptation and grid quality, in CRC Handbook of Grid Generation, CRC, Boca Raton, FL, 1998, pp. 34-1-33.
42. ∞ distortion measure, IEEE Signal Proc. Lett., 5 (1997), pp. 33-35.
43. U. MOLLER, M. GALICKI, E. BARESOVA, AND H. WITTE, An efficient vector quantizer providing globally optimal-solutions, IEEE Trans. Signal Proc., 46 (1998), pp. 2515-2529.
44. D. NEWMAN, The hexagon theorem, IEEE Trans. Inform. Theory, 28 (1982), pp. 137-139.
45. R. NICOLAIDES, Direct discretization of planar div-curl problems, SIAM J. Numer. Anal., 29 (1992), pp. 32-56.
46. H. NIEDERREITER, Random Number Generation and Quasi-Monte Carlo Methods, SIAM, Philadelphia, 1992.
47. A. OKABE, B. BOOTS, AND K. SUGIHARA, Spatial. Tessellations; Concepts and Applications of Voronoi Diagrams, Wiley, Chichester, UK, 1992.
48. C. PAPADIMITRIOU AND K. STEIGLITZ, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982.
49. A. PAPAGEORGIOU AND J. TRAUB, Fast evaluation of multidimensional integrals, Comput. Phys., 11 (1997), pp. 574-579.
50. K. PARNA, Strong consistency of k-means clustering criterion in separable metric spaces, Tartu Riikl. Ul. Toimetised, 733 (1986), pp. 86-96.
51. K. PARNA, On the stability of k-means clustering in metric spaces, Tartu Riikl. Ul. Toimetised, 798 (1988), pp. 19-36.
52. D. POLLARD Strong consistency of k-mean clustering, Ann. Statist., 9 (1981), pp. 135-140.
53. D. POLLARD, A central limit theorem for k-means clustering, Ann. Statist., 10 (1982), pp. 919-926.
54. F. PREPARATA AND M. SHAMOS, Computational Geometry - An Introduction, Springer, New York, 1985.
55. S. SELIM AND M. ISMAIL, K-means-type algorithms: A generalized convergence theorem and characterization of local optimality, IEEE Trans. Pattern Anal. Mach. Intell., PAMI-6 (1984), pp. 81-87.
56. W. SHEPPARD, On the calculation of the most probable values of frequency constants for data arranged according to equidistant divisions of a scale, Proc. London Math. Soc., 24 (1898), pp. 353-390.
57. I. SLOAN AND H. WOŹNIAKOWSKI, When are quasi-Monte Carlo algorithms efficient for high-dimensional integrals?, J. Complexity, 14 (1998), pp. 1-33.
58. W. STUTE AND L. ZHU, Asymptotics of k-means clustering based on projection pursuit, Sankhyā Ser. A, 57 (1995), pp. 462-471.
59. A. SUZUKI AND M. IRI, Approximation of a tessellation of the plane by a Voronoi diagram, J. Oper. Res. Soc. Japan, 29 (1986), pp. 69-96.
60. M. TANEMURA AND M. HASEGAWA, Geometrical models of territory. I. Models for synchronous and asynchronous settlement of territories, J. Theoret. Biol., 82 (1980), pp. 477-496.
61. A. TRUSHKIN, On the design of an optimal quantizer, IEEE Trans. Inform. Theory, 39 (1993), pp. 1180-1194.
62. S. WAN, S. WONG, AND P. PRUSINKIEWICZ, An algorithm for multidimensional data clustering ACM Trans. Math. Software, 14 (1988), pp. 153-162.
63. M. WONG, Asymptotic properties of univariate sample k-means clusters, J. Classification, 1 (1984), pp. 255-270.
64. X. WU AND I. WITTEN, A Fast k-Means Type Clustering Algorithm, Tech. Report, Department of Computer Science, University of Calgary, Alberta, Canada, 1985.