Version 5.0 The LEDA User Manual

POINT SET
POINT SET
T (const list& S);
creates a POINT SET T of the points in S. If S contains multiple
occurrences of points only the last occurrence of each point is
retained.
T (const GRAPH & G);
initializes T with a copy of G.
Precondition: Is Delaunay(G) is true.
3. Operations
void T.init(const list& L)
makes T a POINT SET for the points in S.
POINT T.pos(node v) returns the position of node v.
POINT T.pos source(edge e) returns the position of source(e).
POINT T.pos target(edge e) returns the position of target(e).
SEGMENT T.seg(edge e) returns the line segment corresponding to edge e
(SEGMENT (T.pos source(e), T.pos target(e))).
LINE T.supporting line(edge e) returns the supporting line of edge e
(LINE(T.pos source(e), T.pos target(e))).
int T.orientation(edge e, POINT p)
returns orientation(T.seg(e), p).
int T.dim( ) returns −1 if S is empty, returns 0 if S consists
of only one point, returns 1 if S consists of at
least two points and all points in S are collinear,
and returns 2 otherwise.
list T.points( ) returns S.
bool
T.get bounding box(POINT & lower left, POINT & upper right)
returns the lower left and upper right corner of
the bounding box of T . The operation returns
true, if T is not empty, false otherwise.
list T.get convex hull( ) returns the convex hull of T .
edge T.get hull dart( ) returns a dart of the outer face of T (i.e., a dart
of the convex hull).
edge T.get hull edge( ) as above.
bool T.is hull dart(edge e) returns true if e is a dart of the convex hull of
T , i.e., a dart on the face cycle of the outer face.