MyGAL is a computational geometry algorithms library.

For the moment, the library is essentially based on my implementation of Fortune's algorithm. It includes:

• Voronoi diagram
• Lloyd's relaxation
• Delaunay triangulation

MyGAL is:

• easy to use
• easy to install (header-only and no external dependency)
• fast
• well documented
• multi-precision

To get started, you just have to add the include folder of MyGAL to the include directories of your project. Then, you just have to add this header to start using MyGAL:

#include <MyGAL/FortuneAlgorithm.h>

To use the Fortune's algorithm to generate a Voronoi diagram, do the following:

auto points = std::vector<Vector2<double>>{{0.354, 0.678}, {0.632, 0.189}, {0.842, 0.942}}; // Generate some points
auto algorithm = FortuneAlgorithm<double>(points); // Initialize an instance of Fortune's algorithm
algorithm.construct(); // Construct the diagram

The template parameter corresponds to the floating point type used in computations. double is the recommended one.

The output diagram is unbounded but most of the time you will want a bounded one. To do that, we will compute the intersection between the diagram and a box. In MyGAL, we do that in two steps:

algorithm.bound(Box<double>{-0.05, -0.05, 1.05, 1.05}); // Bound the diagram
auto diagram = algorithm.getDiagram(); // Get the constructed diagram
diagram.intersect(Box<double>{0.0, 0.0, 1.0, 1.0}); // Compute the intersection between the diagram and a box

Firstly, we bound the diagram then we compute the intersection. The two steps are due to technical details, you can read this article if you want to know more. It is recommended to use a box slightly bigger for the bounded step than the one for the intersection step. Otherwise you might face numerical issues.

You can also obtain a Delaunay triangulation from the diagram:

auto triangulation = diagram.computeTriangulation();

Or you can apply Lloyd's algorithm:

auto relaxedPoints = diagram.computeLloydRelaxation()

If you want to build the example, you can use the cmake file present in the example folder. You will need SFML.

The controls of the example are:

• N: to generate new random points
• R: to apply the Lloyd's algorithm
• T: to show the Delaunay triangulation

• If several points are aligned horizontally (exactly the same y-coordinate), the diagram may be incorrect.
• At least two points are expected.
• The algorithms are tuned to work with coordinates between 0 and 1. You may want to scale your data to obtain better results.

The documentation is available online here.

If you want to build the documentation, you have to have Doxygen installed. Then you just have to execute the doxygen command in the doc folder.

To know more about the implementation you can read some articles on my blog.

Distributed under the GNU Lesser GENERAL PUBLIC LICENSE version 3

Voronoi diagram:

Delaunay triangulation:

Lloyd's relaxation: