Version 5.0 The LEDA User Manual

int t.side of(const point& p)
region kind t.region of(const point& p)
bool t.inside(const point& p)
bool t.outside(const point& p)
bool t.on boundary(const point& p)
bool t.contains(const point& p)
bool t.intersection(const line& l)
bool t.intersection(const segment& s)
returns +1 if p lies to the left of t, 0 if p lies on t and −1
if p lies to the right of t.
returns BOUNDED REGION if p lies in the bounded
region of t, ON REGION if p lies on t and
UNBOUNDED REGION if p lies in the unbounded region.
returns true, if p lies to the left of t.
returns true, if p lies to the right of t.
decides whether p lies on the boundary of t.
decides whether t contains p.
decides whether the bounded region or the boundary of t
and l intersect.
decides whether the bounded region or the boundary of t
and s intersect.
triangle
t.translate(double dx, double dy)
returns t translated by vector (dx, dy).
triangle t.translate(const vector& v)
returns t + v, i.e., t translated by vector v.
Precondition: v.dim() = 2.
triangle
triangle
t + const vector& v
returns t translated by vector v.
t − const vector& v
returns t translated by vector −v.
triangle t.rotate(const point& q, double a)
returns t rotated about point q by angle a.
triangle
t.rotate(double alpha)
returns t.rotate(t.point1(), alpha).