cvt_square_uniform


cvt_square_uniform, a MATLAB code which iteratively calculates a Centroidal Voronoi Tessellation (CVT) in a square with uniform density.

As you watch the CVT develop, for instance, you will be able to guess something about the angle of intersection between the boundaries of the region, and the edges of Voronoi regions.

CVT_SQUARE_UNIFORM works in a square with a uniform density. The function starts from a random initial configuration. Another step of the CVT iteration is carried out each time the user hits RETURN. The MATLAB routines trimesh() and voronoi() are used to simultaneously display the Voronoi diagram and Delaunay triangulation associated with the generators. Moreover, the nearest-neighbor search and centroid computation are carried out efficiently using MATLAB's Delaunay search and rapid array accumulation. The calling sequence is:

[ p, t ] = cvt_square_uniform ( n, sample_num, delaunay_display )

Licensing:

The computer code and data files described and made available on this web page are distributed under the GNU LGPL license.

Languages:

cvt_square_uniform is available in a MATLAB version.

Related Data and Programs:

cvt_box, a MATLAB code which constructs a modified cvt in which some points are forced to lie on the boundary.

ccvt_reflect, a MATLAB code which tries to construct a modified cvt in which some points are forced to lie on the boundary, using a reflection idea.

cvt_1d_lloyd, a MATLAB code which computes an n-point centroidal voronoi tessellation (cvt) within the interval [0,1], under a uniform density.

cvt_1d_nonuniform, a MATLAB code which allows the user to watch the evolution of a cvt computed over a 1d interval with a nonuniform density.

cvt_1d_sampling, a MATLAB code which computes an n-point centroidal voronoi tessellation (cvt) within the interval [0,1], under a uniform density, using sampling to estimate the voronoi regions.

cvt_2d_sampling, a MATLAB code which computes an n-point centroidal voronoi tessellation (cvt) within the unit square [0,1]x[0,1], under a uniform density, using sampling to estimate the voronoi regions.

cvt_circle_nonuniform, a MATLAB code which calculates a nonuniform centroidal voronoi tessellation (cvt) over a circle.

cvt_circle_uniform, a MATLAB code which calculates a centroidal voronoi tessellation (cvt) over a circle with uniform density.

cvt_square_nonuniform, a MATLAB code which iteratively calculates a centroidal voronoi tessellation (cvt) over a square, with a nonuniform density.

cvt_square_uniform_test

cvtm_1d, a MATLAB code which estimates a mirror-periodic centroidal voronoi tessellation (cvtm) in the periodic interval [0,1], using a version of lloyd's iteration.

cvtp_1d, a MATLAB code which estimates a periodic centroidal voronoi tessellation (cvtp) in the periodic interval [0,1], using a version of lloyd's iteration.

discrete_pdf_sample_2d, a MATLAB code which demonstrates how to construct a probability density function (pdf) from a table of sample data, and then to use that pdf to create new samples.

florida_cvt_geo, a MATLAB code which explores the creation of a centroidal voronoi tessellation (cvt) of the state of florida, based solely on geometric considerations.

test_triangulation, a MATLAB code which defines the geometry of a number of sample regions.

voronoi_plot, a MATLAB code which plots the voronoi neighborhoods of points using l1, l2, linfinity or arbitrary lp norms;

Reference:

  1. Franz Aurenhammer,
    Voronoi diagrams - a study of a fundamental geometric data structure,
    ACM Computing Surveys,
    Volume 23, Number 3, pages 345-405, September 1991.
  2. John Burkardt, Max Gunzburger, Janet Peterson, Rebecca Brannon,
    User Manual and Supporting Information for Library of Codes for Centroidal Voronoi Placement and Associated Zeroth, First, and Second Moment Determination,
    Sandia National Laboratories Technical Report SAND2002-0099,
    February 2002.
  3. Qiang Du, Vance Faber, Max Gunzburger,
    Centroidal Voronoi Tessellations: Applications and Algorithms,
    SIAM Review,
    Volume 41, Number 4, December 1999, pages 637-676.

Source Code:


Last revised on 23 December 2018.