d-delaunay

D-dimensional Delaunay triangulations in Rust, inspired by CGAL.

Introduction

This library implements d-dimensional Delaunay triangulations in Rust. It is inspired by CGAL, which is a C++ library for computational geometry; and Spade, a Rust library implementing 2D Delaunay triangulations, Constrained Delaunay triangulations, and Voronoi diagrams. The eventual goal of this library is to provide a lightweight alternative to CGAL for the Rust ecosystem.

Features

• Arbitrary data types associated with vertices and cells
• d-dimensional Delaunay triangulations
• Serialization/Deserialization of all data structures to/from JSON
• Tested for 3-, 4-, and 5-dimensional triangulations

At some point I may merge into another library, such as Spade or delaunay, but for now I am developing this to use in my research without trying to figure out how to mesh with other libraries and coding conventions, and with the minimum number of traits to do generic computational geometry.

Development Tools

The repository includes utility scripts for development, testing, and performance analysis:

Benchmarking and Performance

• Automated benchmark execution: Run triangulation benchmarks across multiple dimensions with GitHub Actions
• Baseline generation: Create performance baselines for regression detection
• Performance regression testing: Compare benchmark results against baseline metrics

See benches/README.md for detailed performance results, baseline metrics, and analysis.

Testing and Validation

• Example execution: Run all example programs to verify functionality
• Comprehensive testing: Automated discovery and execution of test suites

See scripts/README.md for detailed documentation on available development scripts and their usage.

References

The library's geometric predicates and algorithms are based on established computational geometry literature:

Circumcenter and Circumradius Calculations

• Lévy, Bruno, and Yang Liu. "Lp Centroidal Voronoi Tessellation and Its Applications." ACM Transactions on Graphics 29, no. 4 (July 26, 2010): 119:1-119:11. DOI: 10.1145/1778765.1778856

Robust Geometric Predicates

• Shewchuk, J. R. "Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates." Discrete & Computational Geometry 18, no. 3 (1997): 305-363. DOI: 10.1007/PL00009321
• Shewchuk, J. R. "Robust Adaptive Floating-Point Geometric Predicates." Proceedings of the Twelfth Annual Symposium on Computational Geometry (1996): 141-150.

Lifted Paraboloid Method

• Preparata, Franco P., and Michael Ian Shamos. "Computational Geometry: An Introduction." Texts and Monographs in Computer Science. New York: Springer-Verlag, 1985.
• Edelsbrunner, Herbert. "Algorithms in Combinatorial Geometry." EATCS Monographs on Theoretical Computer Science. Berlin: Springer-Verlag, 1987.

Triangulation Data Structures and Algorithms

• CGAL Triangulation Documentation
• Bowyer, A. "Computing Dirichlet tessellations." The Computer Journal 24, no. 2 (1981): 162-166. DOI: 10.1093/comjnl/24.2.162
• Watson, D.F. "Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes." The Computer Journal 24, no. 2 (1981): 167-172. DOI: 10.1093/comjnl/24.2.167
• de Berg, M., et al. "Computational Geometry: Algorithms and Applications." 3rd ed. Berlin: Springer-Verlag, 2008. DOI: 10.1007/978-3-540-77974-2