Computation of Centroidal Voronoi Tessellations in High Dimensional spaces

Abstract

Owing to the natural interpretation and various desirable mathematical properties, centroidal Voronoi tessellations (CVT) have found a wide range of applications and correspondingly a vast development in their literature. However the computation of CVT in higher dimensional spaces still remains difficult. In this paper, we exploit the non-uniqueness of CVTs in higher dimensional spaces for their computation. We construct such high dimensional tessellations from CVTs in one-dimensional spaces. We then prove that such a tessellation is centroidal under the condition of independence among densities over the one-dimensional spaces considered. Various numerical evaluations backup the theoretical result through the low energy of the tessellations. The resulting grid-like tessellations are obtained efficiently with minimal computation time.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…