CGAL 6.0.1 - 2D and 3D Linear Geometry Kernel
|
AdaptableTernaryFunction
Operations | |
A model of this concept must provide: | |
bool | operator() (const Kernel::Plane_3 &p, const Kernel::Point_3 &q, const Kernel::Point_3 &r) |
returns true, iff the signed distance from point q to plane p is smaller than the signed distance from point r to p . | |
bool | operator() (const Kernel::Point_3 &p1, const Kernel::Point_3 &p2, const Kernel::Point_3 &p3, const Kernel::Point_3 &q, const Kernel::Point_3 &r) |
returns true, iff the signed distance from point q to the plane p defined by p1, p2, p3 is smaller than the signed distance from point r to p . | |
bool Kernel::LessSignedDistanceToPlane_3::operator() | ( | const Kernel::Point_3 & | p1, |
const Kernel::Point_3 & | p2, | ||
const Kernel::Point_3 & | p3, | ||
const Kernel::Point_3 & | q, | ||
const Kernel::Point_3 & | r | ||
) |
returns true, iff the signed distance from point q
to the plane p
defined by p1, p2, p3
is smaller than the signed distance from point r
to p
.
p, q
, and r
are not collinear.