Computation of Centroidal Voronoi Tessellations in High Dimensional Spaces

被引:2
|
作者
Telsang, Bhagyashri [1 ]
Djouadi, Seedik M. [1 ]
机构
[1] Univ Tennessee, Dept Elect Engn & Comp Sci, Knoxville, TN 37996 USA
来源
基金
美国国家科学基金会;
关键词
Generators; Probabilistic logic; Density functional theory; Aerospace electronics; Probability density function; Indexes; Writing; Centroidal voronoi tessellations; computational methods; high-dimensional spaces; COVERAGE CONTROL;
D O I
10.1109/LCSYS.2022.3185032
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Owing to the natural interpretation and various desirable mathematical properties, centroidal Voronoi tessellations (CVTs) have found a wide range of applications and correspondingly a vast development in their literature. However, the computation of CVTs in higher dimensional spaces remains difficult. In this letter, we exploit the non-uniqueness of CVTs in higher dimensional spaces for their computation. We construct such high dimensional tessellations by decomposing into CVTs in one-dimensional spaces. We then prove that such a tessellation is centroidal under the condition of independence among densities over the 1-D spaces. Various numerical evaluations backup the theoretical result through the low energy of the grid-like tessellations, and are obtained with minimal computation time. We also compare the proposed decomposition method with the popular MacQueen's probabilistic method.
引用
收藏
页码:3313 / 3318
页数:6
相关论文
共 50 条