This library is used for computing the Delaunay triangulation of 2D point sets.
An example Delaunay triangulation output for 32 points is shown below.
Why is this library special?
Speed! This is a pure python implementation of the Guibas & Stolfi's divide and conquer algorithm. The divide and conquer algorithm has been shown to be the fastest DT generation technique, with O(n log n) running time. Furthermore, this code has been parallelised using the MPI for Python (mpi4py) library to utilise multiple CPU cores. This allows the algorithm to be efficiently scaled for distributed computing across supercomputer nodes.
Parallel Delaunay can be installed by running pip install parallel-delaunay. It requires Python 3.8+ to run.
To import and use the library see scipi_comparison.py for an example of generating a random set of 2D points and running the delaunay triangulation algorithm.
As seen in the graph below, this Delaunay triangulation implementation scales just as efficiently as the SciPy implementation. The SciPy library is written in C and wrapped in Python for ease of use. As a result, the SciPy DT algorithm is consistently around 40x faster for a given number of points. However, the benefit of my library is that it can take advantage of multiple CPU cores, offering a performance advantage unavailable to SciPy users. By utilising the multiple cores available in modern computers, the run time can be reduced linearly by a factor approximately equal to the number of available threads.
This graph can be reproduced by running python src/triangulation_benchmarks.py.
This repository is currently structured as follows.
├── src
├── triangulation_core
├── points_tools
├── generate_values.py
└── split_list.py
├── edge_topology.py
├── linear_algebra.py
├── triangulation.py
└── triangulation_primitives.py
├── utilities
└── settings.py
[1] Guibas, Leonidas and Stolfi, Jorge 'Primitives for the Manipulation of General Subdivisions and the Computation of Voronoi' In: ACM Trans. Graph.4.2 (Apr.1985), pp. 74–123. issn: 0730-0301 doi:10.1145/282918.282923