Voronoi Diagram Animation
Move the points
Press "Go"
Be amazed!
Voronoi diagram
We are given a finite set of points {p1, …, pn} in the Euclidean plane. Voronoi cell Rk corresponding to point pk consists of every point in the Euclidean plane whose distance to pk is less than or equal to its distance to any other pk. Each such cell is obtained from the intersection of half-spaces, and hence it is a convex polygon. The line segments of the Voronoi diagram are all the points in the plane that are equidistant to the two nearest sites, i. e. line segment bisector. The Voronoi vertices (nodes) are the points equidistant to three (or more) sites
Liebling, T., Pournin, L. "Voronoi diagrams and Delaunay triangulations: ubiquitous Siamese twins". In: Optimization Stories. Documenta Mathematica. Extra Volume ISMP. s. 419–431. 2012.