Version 5.0 The LEDA User Manual

ool T.is hull edge(edge e) as above.
bool T.is diagram dart(edge e) returns true if e is a dart of the Delaunay diagram,
i.e., either a dart on the convex hull or a
dart where the incident triangles have distinct
circumcircles.
bool T.is diagram edge(edge e) as above.
edge T.d face cycle succ(edge e) returns the face cycle successor of e in the Delaunay
diagram of T . Precondition: e belongs
to the Delaunay diagram.
edge
T.d face cycle pred(edge e) returns the face cycle predecessor of e in the Delaunay
diagram of T . Precondition: e belongs
to the Delaunay diagram.
bool T.empty( ) decides whether T is empty.
void T.clear( ) makes T empty.
edge
edge
node
T.locate(POINT p, edge loc start = NULL)
T.locate(POINT p, const list& loc start)
T.lookup(POINT p, edge loc start = NULL)
returns an edge e of T that contains p or that
borders the face that contains p. In the former
case, a hull dart is returned if p lies on
the boundary of the convex hull. In the latter
case we have T.orientation(e, p) > 0 except if
all points of T are collinear and p lies on the induced
line. In this case target(e) is visible from
p. The function returns nil if T has no edge.
The optional second argument is an edge of T ,
where the locate operation starts searching.
returns locate(p, e) with e in loc start. If
loc start is empty, we return locate(p, NULL).
The operation tries to choose a good starting
edge for the locate operation from loc start.
Precondition: All edges in loc start must be
edges of T .
if T contains a node v with pos(v) = p the result
is v otherwise the result is nil. The optional second
argument is an edge of T , where the locate
operation starts searching p.