delaunay
Mojo module 🡭
delaunay
Delaunay triangulation of scattered points using Bowyer-Watson insertion.
Bowyer-Watson incremental insertion: start from one super-triangle that contains every point, insert points one at a time, delete the triangles whose circumcircle the new point falls inside, and re-fill that hole by joining its boundary to the new point.
Adjacency supports walking to each insertion and flooding its circumcircle cavity. Boustrophedon grid ordering keeps consecutive insertions nearby. The result contains vertex and triangle lists; build-time adjacency is not retained.
Structs
Triangulation: Triangles over a point set, as flat index triples.