Constructs Voronoi diagrams. Some samples:

Polygon Count	Input	Output
40,000
6,000
40,000
4,000
50,000

Each can do a variable amount of cells to generate.

• BruteMain.kt - Brute force implementation. Very slow! Takes an image as input and generates Voronoi diagram over image.

• KdMain.Kt - Uses k-d tree for nearest neighbor lookup. Faster! Can do ~50,000 points in ~5 seconds. Takes an image as input and generates Voronoi diagram over image.

• VoronoiGuiMain.kt - Generates Voronoi diagram with a GUI for seeing it generated real time

• VoronoiImageMain.kt - Generates plain image of Voronoi diagram