Skip to content

An algorithm to compute CVTs for finitely generated Cantor distributions

Research output: Contribution to journalArticle

Original languageEnglish
JournalSoutheast Asian Bulletin of Mathematics
DateAccepted/In press - 22 May 2019

Abstract

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 S1(x) = r1x and S2(x) = r2x+(1−r2) for x ∈ R, where r1, r2 > 0 and r1+r2 < 1, with respect to any probability distribution P such that P = p1P ◦ S−1 1 + p2P ◦ S−12, where p1, p2 > 0 and p1 + p2 = 1.

    Research areas

  • probability measure, cantor set, distortion error, centroidal voronoi tessellation

Documents

Documents

  • Full-text PDF (accepted author manuscript)

    Accepted author manuscript, 518 KB, PDF-document

    Embargo ends: 1/01/99

    Request copy

View research connections

Related faculties, schools or groups