31.01.2014 Views

Version 5.0 The LEDA User Manual

Version 5.0 The LEDA User Manual

Version 5.0 The LEDA User Manual

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

ool l.project(const d3 point& p, const d3 point& q, const d3 point& v,<br />

d3 line& m)<br />

if the projection of l into the plane through (p, q, v)<br />

is not a point, the function returns true and assignes<br />

the projection to m. Otherwise false is returned.<br />

d3 line<br />

l.translate(double dx, double dy, double dz)<br />

returns l translated by vector (dx, dy, dz).<br />

d3 line l.translate(const vector& v)<br />

returns l translated by v.<br />

Precond. : v.dim( ) = 3.<br />

d3 line l + const vector& v returns l translated by vector v.<br />

d3 line l − const vector& v returns l translated by vector −v.<br />

d3 line l.reflect(const d3 point& p, const d3 point& q, const d3 point& v)<br />

d3 line l.reflect(const d3 point& p)<br />

returns l reflected across the plane through (p, q, v).<br />

returns l reflected across point p.<br />

d3 line l.reverse( ) returns l reversed.<br />

vector l.to vector( ) returns point2 ( ) − point1 ( ).<br />

bool l.intersection(const d3 segment& s)<br />

decides, whether l and s intersect in a single point.<br />

bool l.intersection(const d3 segment& s, d3 point& p)<br />

bool l.intersection(const d3 line& m)<br />

decides, whether l and s intersect in a single point. If<br />

so, the point of intersection is assigned to p.<br />

decides, whether l and m intersect.<br />

bool l.intersection(const d3 line& m, d3 point& p)<br />

double l.sqr dist(const d3 point& p)<br />

double l.distance(const d3 point& p)<br />

decides, whether l and m intersect in a single point.<br />

If so, the point of intersection is assigned to p.<br />

returns the square of the distance between l and p.<br />

returns the distance between l and p.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!