A Computational-Geometry Approach: Euclidean Distance and Voronoi Tessellation
Seed Points
| # | Label | X | Y | Action |
|---|
How It Works
Given a set of seed points in the plane, the Voronoi tessellation partitions the space into regions. Every point inside one region is closer to its owning seed point than to any other seed, measured by Euclidean distance. This diagram renders each polygon using the Fortune’s algorithm sweep-line concept implemented in the browser.