Module spade::delaunay

Expand description

A two dimensional Delaunay triangulation.

Structs

An iterator that iterates over the outgoing edges from a vertex.

A two dimensional constrained Delaunay triangulation.

A two dimensional Delaunay triangulation.

Locate strategy that walks along the edges of a triangulation until the target point is found.

A handle to a directed edge.

A handle to a face.

An iterator that iterates over the edges adjacent to a face.

A handle to a vertex.

Stores information about a point’s position in triangulation.

Locate strategy for Delaunay triangulations.

Locate strategy that uses an r-tree to locate points in O(log(n)) time.

Handle to an edge.

Handle to a face.

Handle to a vertex.

Type shorthand for a constrained Delaunay triangulation using the precise FloatKernel.

Type shorthand for a Delaunay triangulation with f64 coordinates that uses FloatKernel for geometric calculations.

Type shorthand for a Delaunay triangulation with i64 or i32 coordinates that uses the trivial kernel for geometric calculations.

Locate strategy that uses an r-tree to locate points in O(log(n)) time.