Version 5.0 The LEDA User Manual

ool cs.contains(const r circle point& p)
returns true iff cs contains p.
bool cs.overlaps(const r circle segment& cs2 )
bool cs.wedge contains(const real point& p)
returns true iff cs (properly) overlaps cs2 .
returns true iff the (closed) wedge induced by cs contains
p. This wedge is spanned by the rays which
start at the center and pass through source and target.
(Note that p belongs to cs iff p is on the supporting
circle and the wedge contains p.)
r circle segment cs.reverse( )
returns the reversal of cs, i.e. source and target are
swapped and the supporting circle is reversed.
r circle segment cs.translate(rational dx, rational dy)
r circle segment cs.translate(const rat vector& v)
r circle segment cs + const rat vector& v
r circle segment cs − const rat vector& v
returns cs translated by vector (dx, dy).
returns cs translated by vector v.
returns cs translated by vector v.
returns cs translated by vector −v.
r circle segment cs.rotate90(const rat point& q, int i = 1)
returns cs rotated about q by an angle of i×90 degrees.
If i > 0 the rotation is counter-clockwise otherwise it
is clockwise.
r circle segment cs.reflect(const rat point& p, const rat point& q)
r circle segment cs.reflect(const rat point& p)
list cs.intersection(const rat line& l)
list cs.intersection(const real line& l)
returns cs reflected across the straight line passing
through p and q.
returns cs reflected across point p.
computes cs ∩ l (ordered along l).
as above.
list cs.intersection(const rat circle& c)
computes cs ∩ c (ordered lexicographically).