Version 5.0 The LEDA User Manual

at line l.reflect(const rat point& p)
returns l reflected across point p.
rat line l.reverse( ) returns l reversed.
rational l.sqr dist(const rat point& q)
rat segment l.perpendicular(const rat point& p)
returns the square of the distance between l and
q.
returns the segment perpendicular to l with source
p and target on l.
rat point l.dual( ) returns the point dual to l.
Precondition: l is not vertical.
int l.orientation(const rat point& p)
int l.side of(const rat point& p)
bool l.contains(const rat point& p)
computes orientation(a, b, p), where a ≠ b and a
and b appear in this order on line l.
computes orientation(a, b, p), where a ≠ b and a
and b appear in this order on line l.
returns true if p lies on l.
bool l.clip(rat point p, rat point q, rat segment& s)
clips l at the rectangle R defined by p and q. Returns
true if the intersection of R and l is nonempty
and returns false otherwise. If the intersection
is non-empty the intersection is assigned to
s; It is guaranteed that the source node of s is no
larger than its target node.
bool l == const rat line& g returns true if the l and g are equal as oriented
lines.
bool equal as sets(const rat line& l, const rat line& g)
Non-Member Functions
int orientation(const rat line& l, const rat point& p)
int cmp slopes(const rat line& l1 , const rat line& l2 )
returns true if the l and g are equal as unoriented
lines.
computes orientation(a, b, p), where a ≠ b and a
and b appear in this order on line l.
returns compare(slope(l 1 ), slope(l 2 )).