Version 5.0 The LEDA User Manual

d3 plane p.to float( ) returns a floating point approximation of p.
rational p.sqr dist(const d3 rat point& q)
rat vector p.normal project(const d3 rat point& q)
returns the square of the Euclidean distance between p
and q.
returns the vector pointing from q to its projection on
p along the normal direction.
int p.intersection(const d3 rat point p1 , const d3 rat point p2 ,
d3 rat point& q)
if the line l through p1 and p2 intersects p in a single
point this point is assigned to q and the result is 1,
if l and p do not intersect the result is 0, and if l is
contained in p the result is 2.
int p.intersection(const d3 rat plane& Q, d3 rat point& i1 , d3 rat point& i2 )
if p and plane Q intersect in a line L then (i1, i2) are
assigned two different points on L and the result is 1,
if p and Q do not intersect the result is 0, and if p = Q
the result is 2.
d3 rat plane
d3 rat plane
p.translate(const rational& dx, const rational& dy, const rational& dz)
returns p translated by vector (dx, dy, dz).
p.translate(integer dx, integer dy, integer dz, integer dw)
returns p translated by vector (dx/dw, dy/dw, dz/dw).
d3 rat plane p.translate(const rat vector& v)
returns p+v, i.e., p translated by vector v.
Precondition: v.dim() = 3.
d3 rat plane
p + const rat vector& v
returns p translated by vector v.
d3 rat plane p.reflect(const d3 rat plane& Q)
returns p reflected across plane Q.
d3 rat plane p.reflect(const d3 rat point& q)
returns p reflected across point q.
d3 rat point p.reflect point(const d3 rat point& q)
returns q reflected across plane p.
int p.side of(const d3 rat point& q)
computes the side of p on which q lies.