Expand description
A Rust implementation of Fortune’s Linesweep algorithm for computing Voronoi diagrams.
Structs§
- DCEL
- Doubly Connected Edge List representation of a subdivision of the plane.
- Point
- A point in two dimensions
Functions§
- lloyd_
relaxation - Produces the Lloyd Relaxation of a set of points.
- make_
line_ segments - Constructs the line segments of the Voronoi diagram.
- make_
polygons - Constructs the faces of the Voronoi diagram.
- polygon_
centroid - Computes the centroid of a polygon.
- voronoi
- Computes the Voronoi diagram of a set of points. Returns a Doubly Connected Edge List.