Version 5.0 The LEDA User Manual

list T.range search(node v, const POINT& p)
returns the list of all nodes contained in the
closure of disk C with center pos[v] and having
p in its boundary.
list T.range search(const POINT & a, const POINT & b, const POINT & c)
returns the list of all nodes contained in the
closure of the triangle (a, b, c).
Precondition: a, b, and c must not be collinear.
This is a non-const operation.
list T.range search parallelogram(const POINT & a, const POINT & b,
const POINT & c)
returns the list of all nodes contained in the
closure of the parallelogram (a, b, c, d) with d =
a + (c − b).
Precondition: a, b, and c must not be collinear.
This is a non-const operation.
list T.range search(const POINT & a, const POINT & b)
list T.minimum spanning tree( )
list T.relative neighborhood graph( )
returns the list of all nodes contained in the closure
of the rectangle with diagonal (a, b). This
is a non-const operation.
returns the list of edges of T that comprise a
minimum spanning tree of S.
returns the list of edges of T that comprise a
relative neighborhood graph of S.
void T.compute voronoi(GRAPH & V )
Drawing Routines
computes the corresponding Voronoi diagram
V . Each node of V D is labeled with its defining
circle. Each edge is labeled with the site lying
in the face to its left.
The functions in this section were designed to support the drawing of Delaunay triangulations
and Voronoi diagrams.
void T.draw nodes(void (∗draw node)(const POINT & ))
calls draw node(pos(v)) for every node v of T .