Pith. sign in

REVIEW

Computation of Centroidal Voronoi Tessellations in High Dimensional spaces

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2203.15507 v1 pith:WZ2CEXLN submitted 2022-03-24 cs.CG

Computation of Centroidal Voronoi Tessellations in High Dimensional spaces

classification cs.CG
keywords spacestessellationscomputationdimensionalcentroidalcvtshighhigher
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original 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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.