Up
# module Delaunay

: sig

Delaunay triangulation.

#

#

module type Triangulation = sig

The result of triangulation is an abstract value of type `triangulation`

.
Then one can iterate over all edges of the triangulation.

#

type triangulation

#

val triangulate : S.point array -> triangulation

`triangulate a`

computes the Delaunay triangulation of a set of
points, given as an array `a`

. If `N`

is the number of points
(that is `Array.length a`

), then the running time is $O(N \log N)$
on the average and $O(N^2)$ on the worst-case. The space used is
always $O(N)$.

end

#

Generic Delaunay triangulation

#

Delaunay triangulation with integer coordinates

#

Delaunay triangulation with floating point coordinates

end