Computational Geometry in Rust

GitHubDiscordAPI ReferencePlaygroundLandscapeCorrectness


Computational Geometry is notoriously difficult to get right. The convex hull algorithm is a prime example of this: From 1972 to 1989, 16 solutions were published in peer-reviewed journals and 7 of them turned out to be wrong.

So, why should you believe RGeometry is correct? To answer this we have to look at RGeometry's design and talk about how it leads to strong guarantees and predictable behaviour.

Fixed precision vs arbitrary precision

Derived Data

Property testing

Random Polygons

Convex Polygons

Monotone Polygons

Emperical testing

Simulation of Simplicity