An algorithm to compute CVTs for finitely generated Cantor distributions

Centroidal Voronoi tessellations (CVTs) are Voronoi tessellations of a region such that the generating points of the tessellations are also the centroids of the corresponding Voronoi regions with respect to a given probability measure. CVT is a fundamental notion that has a wide spectrum of applications in computational science and engineering. In this paper, an algorithm is given to obtain the CVTs with $n$-generators to level $m$, for any positive integers $m$ and $n$, of any Cantor set generated by a pair of self-similar mappings given by $S_1(x)=r_1x$ and $S_2(x)=r_2x+(1-r_2)$ for $x\in \mathbb R$, where $r_1, r_2>0$ and $r_1+r_2 0$ and $p_1+p_2=1$.

[1]  Robert M. Gray,et al.  Locally Optimal Block Quantizer Design , 1980, Inf. Control..

[2]  Sajal K. Das,et al.  CONNECT: Consociating opportunistic network neighbors for constructing a consistent and connected virtual backbone , 2014, Proceeding of IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks 2014.

[3]  Harald Luschgy,et al.  The Quantization of the Cantor Distribution , 1997 .

[4]  Gary L. Wise,et al.  Some remarks on the existence of optimal quantizers , 1984 .

[5]  Krishnan S. Rajan,et al.  A bi-objective algorithm for dynamic reconfiguration of mobile networks , 2012, 2012 IEEE International Conference on Communications (ICC).

[6]  Yuan Song,et al.  Cost-Effective Algorithms for Deployment and Sensing in Mobile Sensor Networks , 2014 .

[7]  M. Roychowdhury.  Optimal quantizers for some absolutely continuous probability measures , 2016, 1608.03815.

[8]  Hui Rao,et al.  On the open set condition for self-similar fractals , 2005 .

[9]  S. Graf,et al.  Foundations of Quantization for Probability Distributions , 2000 .

[10]  L. Ju.  Probabilistic and parallel algorithms for centroidal Voronoi tessellations with application to meshless computing and numerical analysis on surfaces , 2002 .

[11]  Qiang Du,et al.  Centroidal Voronoi Tessellations: Applications and Algorithms , 1999, SIAM Rev..

[12]  J. Rosenblatt,et al.  Optimal Quantization for Piecewise Uniform Distributions , 2017, Uniform distribution theory.

[13]  Carl P. Dettmann,et al.  Quantization for uniform distributions on equilateral triangles , 2015, ArXiv.

[14]  Mikaela Iacobelli.  Asymptotic quantization for probability measures on Riemannian manifolds , 2014, 1412.4026.

[15]  Franziska Hoffmann,et al.  Spatial Tessellations Concepts And Applications Of Voronoi Diagrams , 2016 .

[16]  Tamás Linder,et al.  On the structure of optimal entropy-constrained scalar quantizers , 2002, IEEE Trans. Inf. Theory.

[17]  Lakshmi Roychowdhury.  OPTIMAL QUANTIZERS FOR PROBABILITY DISTRIBUTIONS ON NONHOMOGENEOUS CANTOR SETS , 2015 .

[18]  M. Roychowdhury.  Least upper bound of the exact formula for optimal quantization of some uniform Cantor distributions , 2016, 1606.04134.

[19]  K. Falconer.  Techniques in fractal geometry , 1997 .

[20]  Quantization and centroidal Voronoi tessellations for probability measures on dyadic Cantor sets , 2015, 1509.06037.

[21]  Frank Southworth,et al.  Fractal dimensions of metropolitan area road networks and the impacts on the urban built environment , 2016 .

[22]  Todd J. Bodnar,et al.  City population dynamics and fractal transport networks , 2013 .