|
CGAL 6.0 - 2D and 3D Linear Geometry Kernel
|
AdaptableTernaryFunction Operations | |
A model of this concept must provide: | |
| bool | operator() (const Kernel::Point_3 &p, const Kernel::Point_3 &q, const Kernel::Point_3 &r) |
returns true, iff the three points are collinear and q lies strictly between p and r. | |
| bool Kernel::AreStrictlyOrderedAlongLine_3::operator() | ( | const Kernel::Point_3 & | p, |
| const Kernel::Point_3 & | q, | ||
| const Kernel::Point_3 & | r | ||
| ) |
returns true, iff the three points are collinear and q lies strictly between p and r.
Note that false is returned, if q==p or q==r.