Version 5.0 The LEDA User Manual

gen polygon MINKOWSKI SUM(const polygon& P, const polygon& R,
void (∗conv partition)(const gen polygon& p,
const polygon& r, list& lp,
list& lr),
gen polygon (∗conv unite)(const list& ))
gen polygon MINKOWSKI DIFF(const polygon& P, const polygon& R,
void (∗conv partition)(const gen polygon& p,
const polygon& r, list& lp,
list& lr),
gen polygon (∗conv unite)(const list& ))
gen polygon MINKOWSKI SUM(const gen polygon& P, const polygon& R,
void (∗conv partition)(const gen polygon& p,
const polygon& r, list& lp,
list& lr),
gen polygon (∗conv unite)(const list& ))
gen polygon MINKOWSKI DIFF(const gen polygon& P, const polygon& R,
void (∗conv partition)(const gen polygon& p,
const polygon& r, list& lp,
list& lr),
gen polygon (∗conv unite)(const list& ))
• Euclidean Spanning Trees
void MIN SPANNING TREE(const list& L, GRAPH & T )
computes the Euclidian minimum spanning tree T of the points in L.
• Triangulation Checker
bool Is Convex Subdivision(const GRAPH & G)
returns true if G is a convex planar subdivision.
bool Is Triangulation(const GRAPH & G)
returns true if G is convex planar subdivision in which every bounded
face is a triangle or if all nodes of G lie on a common line.
bool Is Delaunay Triangulation(const GRAPH & G,
delaunay voronoi kind kind)
checks whether G is a nearest (kind = NEAREST ) or furthest
(kind = FURTHEST) site Delaunay triangulation of its vertex set. G
is a Delaunay triangulation iff it is a triangulation and all triangles have
the Delaunay property. A triangle has the Delaunay property if no vertex
of an adjacent triangle is contained in the interior (kind = NEAREST )
or exterior (kind = FURTHEST ) of the triangle.