"A Voronoi diagram is a partitioning of a plane into regions based on distances to points in a specific subset of the plane. That set of points (called seeds, sites, or generators) is specified beforehand, and for each seed there is a corresponding region consisting of all points closer to that seed than to any other. These regions are called Voronoi cells." (https://en.wikipedia.org/wiki/Voronoi_diagram)
A very basic voronoi partitioner written in C++ using the SDL2 graphics library.
It uses a brute force approach, which can result in a performance drop when there are over 20 sites present, although the application is great for illustration purposes.
On Linux systems with the apt package manager:
sudo apt install libsdl2-dev libsdl2-gfx-dev libsdl2-image-dev libsdl2-ttf-dev libsdl2-mixer-dev
- Install the above dependencies.
- Clone the repo
cd ./voronoicmake .make./voronoito run the application
Press : to acces a console-like interface, then type in a command.
Type help and press enter to check the functions available:
helpdisplays the help windowsavesaves the Voronoi diagram asoutput.bmpnodestoggle display of nodesseedstoggle display of seedssitestoggle display of sitescaptoggle capping the nr. of nodes at 16 on/offshuffleshuffle the position of the nodesclearclear all the nodes
