Version 5.0 The LEDA User Manual

at point t[int i] returns the i-th vertex of t. Precondition: 1 ≤ i ≤ 3.
int t.orientation( ) returns the orientation of t.
rational t.area( ) returns the signed area of t (positive, if
orientation(a, b, c) > 0, negative otherwise).
bool t.is degenerate( ) returns true if the vertices of t are collinear.
int t.side of(const rat point& p)
region kind t.region of(const rat point& p)
bool t.inside(const rat point& p)
bool t.outside(const rat point& p)
bool t.on boundary(const rat point& p)
bool t.contains(const rat point& p)
bool t.intersection(const rat line& l)
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.
bool t.intersection(const rat segment& s)
rat triangle t.translate(rational dx, rational dy)
rat triangle t.translate(const rat vector& v)
rat triangle t + const rat vector& v
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.
returns t translated by vector (dx, dy).
returns t + v, i.e., t translated by vector v.
Precondition: v.dim() = 2.
returns t translated by vector v.