Version 5.0 The LEDA User Manual

node
T.lookup(POINT p, const list& loc start)
returns lookup(p, e) with e in loc start. If
loc start is empty, we return lookup(p, NULL).
The operation tries to choose a good starting
edge for the lookup operation from loc start.
Precondition: All edges in loc start must be
edges of T .
node T.insert(POINT p) inserts point p into T and returns the corresponding
node. More precisely, if there is already
a node v in T positioned at p (i.e., pos(v)
is equal to p) then pos(v) is changed to p (i.e.,
pos(v) is made identical to p) and if there is no
such node then a new node v with pos(v) = p
is added to T . In either case, v is returned.
void T.del(node v) removes the node v, i.e., makes T a Delaunay
triangulation for S \ {pos(v)}.
void T.del(POINT p) removes the node p, i.e., makes T a Delaunay
triangulation for S \ p.
node T.nearest neighbor(POINT p)
node T.nearest neighbor(node w)
list T.nearest neighbors(POINT p, int k)
list T.nearest neighbors(node w, int k)
list T.range search(const CIRCLE& C)
computes a node v of T that is closest to p, i.e.,
dist(p, pos(v)) = min{ dist(p, pos(u)) | u ∈ T }.
This is a non-const operation.
computes a node v of T that is closest
to p = T [w], i.e., dist(p, pos(v)) =
min{ dist(p, pos(u)) | u ∈ T }.
returns the k nearest neighbors of p, i.e., a list
of the min(k, |S|) nodes of T closest to p. The
list is ordered by distance from p. This is a
non-const operation.
returns the k nearest neighbors of p = T [w], i.e.,
a list of the min(k, |S|) nodes of T closest to p.
The list is ordered by distance from p.
returns the list of all nodes contained in the
closure of disk C.
Precondition: C must be a proper circle (not a
straight line). This is a non-const operation.