voronoi_test

voronoi_test, an Octave code which calls the built-in voronoi() function, which computes the Voronoi diagram of a set of points.

Licensing:

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

Languages:

voronoi_test is available in a MATLAB version and an Octave version and a Python version.

Related Data and Programs:

delaunay_test, an Octave code which calls the built-in function delaunay(), which computes the Delaunay triangulation of a set of points.

voronoi_mountains, an Octave code which makes a mountain plot of a Voronoi diagram, that is, a surface plot of the distance from each point to its nearest Voronoi generator.

voronoi_neighbors, an Octave code which is given a set of points in the plane and determines the Voronoi adjacency structure, that is, which points share an edge of the Voronoi diagram.

voronoi_plot, an Octave 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.

Source Code:

• voronoi_test.m, calls all the tests.
• voronoi_test.sh, runs all the tests.
• voronoi_test.txt, the output file.

• voronoi_test01.m, applies voronoi() to a set of 9 points.
• voronoi_test02.m, computes and displays the Voronoi diagram of 100 random points.
• voronoi_test03.m, plots points, a Voronoi diagram, and the Delaunay triangulation, and overlays them.
• diamond_points.png, a plot of the points used in the first test;
• diamond_hull.png, the convex hull of the points;
• diamond_voronoi_matlab_1.png, a plot of the Voronoi data returned by voronoi;
• hundred_points.png, a plot of 100 random points;
• hundred_hull.png, the convex hull of the points.
• hundred_voronoi.png, a plot of the Voronoi diagram of the points;