Version 5.0 The LEDA User Manual

double WIDTH(const list& L, line& l1 , line& l2 )
returns the square of the minimum width of a stripe covering all points
in L and the two boundaries of the stripe.
Precondition: L is non-empty
• Halfplane intersections
void
HALFPLANE INTERSECTION(const list& L, list& Lout)
For every line l ∈ L let h l be the closed halfplane lying on the positive
side of l, i.e., h l = { p ∈ R 2 | orientation(l, p) ≥ 0 }, and let
H = ∩ l∈L h l . Then HALFPLANE INTERSECTION computes the list
of lines Lout defining the boundary of H in counter-clockwise ordering.
• Triangulations
edge TRIANGULATE POINTS(const list& L, GRAPH & T )
computes a triangulation (planar map) T of the points in L and returns
an edge of the outer face (convex hull).
void DELAUNAY TRIANG(const list& L, GRAPH & DT )
computes the delaunay triangulation DT of the points in L.
void DELAUNAY DIAGRAM(const list& L, GRAPH & DD)
computes the delaunay diagram DD of the points in L.
void F DELAUNAY TRIANG(const list& L, GRAPH & FDT)
computes the furthest point delaunay triangulation F DT of the points in
L.
void F DELAUNAY DIAGRAM(const list& L, GRAPH & FDD)
computes the furthest point delaunay diagram F DD of the points in L.
• Constraint Triangulations
edge TRIANGULATE SEGMENTS(const list& L,
GRAPH & G)
computes a constrained triangulation (planar map) T of the segments in
L (trivial segments representing points are allowed). The function returns
an edge of the outer face (convex hull).
edge DELAUNAY TRIANG(const list& L, GRAPH & G)
computes a constrained Delaunay triangulation T of the segments in L.
The function returns an edge of the outer face (convex hull).