CGAL 6.1 - 2D and 3D Linear Geometry Kernel
|
#include <Concepts/FunctionObjectConcepts.h>
AdaptableBinaryFunction
CGAL::Plane_3<Kernel>
CGAL::Sphere_3<Kernel>
CGAL::Tetrahedron_3<Kernel>
Operations | |
A model of this concept must provide: | |
bool | operator() (const Kernel::Plane_3 &h, const Kernel::Point_3 &p) |
returns true iff p lies on the positive side of h (h is considered a half-space). | |
bool | operator() (const Kernel::Sphere_3 &s, const Kernel::Point_3 &p) |
returns true iff p lies on the positive side of s . | |
bool | operator() (const Kernel::Tetrahedron_3 &t, const Kernel::Point_3 &p) |
returns true iff p lies on the positive side of t . | |
bool Kernel::HasOnPositiveSide_3::operator() | ( | const Kernel::Plane_3 & | h, |
const Kernel::Point_3 & | p | ||
) |
returns true iff p
lies on the positive side of h
(h
is considered a half-space).
bool Kernel::HasOnPositiveSide_3::operator() | ( | const Kernel::Sphere_3 & | s, |
const Kernel::Point_3 & | p | ||
) |
returns true iff p
lies on the positive side of s
.
bool Kernel::HasOnPositiveSide_3::operator() | ( | const Kernel::Tetrahedron_3 & | t, |
const Kernel::Point_3 & | p | ||
) |
returns true iff p
lies on the positive side of t
.