An implementation of Lloyd's algorithm which iteratively runs a Voronoi solution which for each run uses the previous run's cell area centroids as the new seed points.
Name | Lloyds Voronoi
Nickname | Lloyds
Tab | Mesh
Panel | Triangulation
Division | 2
P | Points (Point) | The points for the initial voronoi solution
B | Boundary (Rectangle) | The containment boundary for the diagram
I | Iterations (Integer) | The number of solution iterations to run
C | Cells (Curve) | The polyline cells of the Voronoi diagram
