Probabilistic methods for centroidal Voronoi tessellations and their parallel implementations

Parallel Computing

Volumn 28, Issue 10, 2002, Pages 1477-1500

  Ju, Lili ^a   Du, Qiang ^b   Gunzburger, Max ^a  

^a IOWA STATE UNIVERSITY   (United States)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

Centroidal Voronoi tessellations; Parallel implementations; Probabilistic algorithms; Rejection method

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATA STORAGE EQUIPMENT; DISTRIBUTED COMPUTER SYSTEMS; PROGRAM PROCESSORS;

PROBABILISTIC METHODS;

PROBABILITY;

EID: 0036787154     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(02)00151-5     Document Type: Article

References (17)

1. Arya S., Mount D., Netanyahu N., Silverman R., Wu A. An optimal algorithm for approximate nearest neighbor searching. J. ACM. 45:1998;891-923.
2. Bentley J. Multidimensional binary search trees used for associative searching. Comm. ACM. 18:1975;509-517.
3. CRAY Inc. Web Site, http://www.cray.com.
4. Du Q., Faber V., Gunzburger M. Centroidal Voronoi tessellations: applications and algorithms. SIAM Rev. 41:1999;637-676.
5. Q. Du, M. Gunzburger, Grid generation and optimization based on centroidal Voronoi tessellations, Appl. Math. Comput., 2001, in press.
6. Q. Du, M. Gunzburger, L.-L. Ju, Meshfree, probabilistic determination of point sets and support regions for meshless computing, Comput. Meths. Appl. Mech. Engrg. 191 (2002) 1349-1366.
7. Hartigan J. Clustering Algorithms. 1975;Wiley-Interscience, New York.
8. Jhum M. Bootstrapping k-means clustering. J. Jpn. Soc. Comput. Stat. 3:1990;1-14.
9. Lee D., Baek S., Sung K. Modified k-means algorithm for vector quantizer design. IEEE Signal Proc. Lett. 4:1997;2-4.
10. Linde Y., Buzo A., Gray R. An algorithm for vector quantizer design. IEEE Trans. Comm. 28:1980;84-95.
11. Lloyd S. Least square quantization in PCM. IEEE Trans. Infor. Theory. 28:1982;129-137.
12. MacQueen J. Some methods for classification and analysis of multivariate observations. Le Cam L., Neyman J. Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, vol. I. 1967;281-297 University of California.
13. Snir M., Otto S., Huss-Lederman S., Walker D., Dongarra J. MPI: The Complete Reference. 1996;MIT.
14. Okabe A., Boots B., Sugihara K., Chiu S. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. 2000;Wiley, Chichester.
15. Pollard D. Strong consistency of k-means clustering. Ann. Stat. 10:1982;135-140.
16. Ross S. A First Course in Probability. fifth ed. 1998;Prentice Hall, Englewood Cliffs.
17. Samet H. The Design and Analysis of Spatial Data Structures. 1990;Addison Wesley, Reading.