Probabilistic methods for centroidal Voronoi tessellations and their parallel implementations
- 1 October 2002
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 28 (10) , 1477-1500
- https://doi.org/10.1016/s0167-8191(02)00151-5
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Meshfree, probabilistic determination of point sets and support regions for meshless computingComputer Methods in Applied Mechanics and Engineering, 2002
- Centroidal Voronoi Tessellations: Applications and AlgorithmsSIAM Review, 1999
- An optimal algorithm for approximate nearest neighbor searching fixed dimensionsJournal of the ACM, 1998
- Modified K-means algorithm for vector quantizer designIEEE Signal Processing Letters, 1997
- BOOTSTRAPPING K-MEANS CLUSTERINGJournal of the Japanese Society of Computational Statistics, 1990
- Least squares quantization in PCMIEEE Transactions on Information Theory, 1982
- An Algorithm for Vector Quantizer DesignIEEE Transactions on Communications, 1980
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975