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