Version 5.0 The LEDA User Manual

edge TRIANGULATE PLANE MAP(GRAPH & G)
computes a constrained triangulation T of the plane map (counterclockwise
straight-line embedded Graph) G. The function returns an
edge of the outer face (convex hull). Precondition: G is simple.
edge DELAUNAY TRIANG(GRAPH & G)
computes a constrained Delaunay triangulation T of the plane map G.
The function returns an edge of the outer face (convex hull). Precondition:
G is simple.
edge TRIANGULATE POLYGON(const polygon& P, GRAPH & G,
list& inner edges, list& outer edges,
list& boundary edges)
triangulates the interior and exterior of the simple polygon P and stores
all edges of the inner (outer) triangulation in inner edges (outer edges)
and the edges of the polygon boundary in boundary edges. The function
returns an edge of the convex hull of P if P is simple and nil otherwise.
edge TRIANGULATE POLYGON(const gen polygon& GP,
GRAPH & G,
list& inner edges, list& outer edges,
list& boundary edges, list& hole edges)
triangulates the interior and exterior of the generalized polygon GP
and stores all edges of the inner (outer) triangulation in inner edges
(outer edges). The function returns nil if GP is trivial, and an edge
of the convex hull otherwise. boundary edges contains the edges of every
counter-clockwise oriented boundary cycle of GP, and hole edges contains
the edges on every clockwise oriented boundary cycle of GP. Note that
the reversals of boundary and hole edges will be returned in inner edges.
Precondition: GP is simple.
edge CONVEX COMPONENTS(const polygon& P, GRAPH & G,
list& inner edges, list& boundary)
if P is a bounded and non-trivial simple polygon its interior is decomposed
into convex parts. All inner edges of the constructed decomposition are
returned in inner edges. boundary edges contains the edges of the polygon
boundary Note that the reversals of boundary edges will be stored in
inner edges. The function returns an edge of the convex hull if P is
simple and non-trivial and nil otherwise.