Expand description
Performs a random search for a viable set of points where each point is separated from all other points by at least the specified minimum distance. It works on an inital set of randomised 2D points finding and replacing clusters with new random points until it settles on the viable declustered set - if that is acheivable given the number of points and, the size of the window and minimum allowable distance.
For more notes and a working example please see the decluster_demo crate that accompanies this lib.
Modules
An iterative algorithm that searches for a set of points where each point is separated from all others by at least the minimum specified distance.
A 2D point representing a location in a results space.
Structs
The drawing surface and piston window used to display the set of points.