Voronoi diagram by Intersection of Half-Planes
|
The definition of a Voronoi diagram is the partitioning of the plane into regions, directed by a set of points, such that all the points in one region are closer to that region's defining point than to any other defining point.
This means that the edges of the Voronoi diagram are segments taken from the perpendicular bisectors of the lines between the points. The segments can be seen as intersections of lines which divide the plane in half, hence the name of this algorithm. Download the zipped file for all movies described on this page by clicking the Download button at the right. Most movies can be viewed by clicking the thumbnail next to each description. |
At the left, one frame in the visualization of constructing the Voronoi diagram by the intersection of half-planes, given six control points. Click on the thumbnail to download and show the movie. Click on the Download button above to download a zipped file of all movies.
There is also a movie which shows the Voronoi diagram of six control points, interrupted through the algorithm by questions posed to the student.
In addition, there are movies showing the half-plane intersection algorithm for ten and sixteen control points.
There is also a movie which shows the Voronoi diagram of six control points, interrupted through the algorithm by questions posed to the student.
In addition, there are movies showing the half-plane intersection algorithm for ten and sixteen control points.