|
CGAL 6.0 - 2D and 3D Linear Geometry Kernel
|
CGAL::are_strictly_ordered_along_line() CGAL::collinear_are_ordered_along_line() CGAL::collinear_are_strictly_ordered_along_line() Functions | |
| template<typename Kernel > | |
| bool | CGAL::are_ordered_along_line (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r) |
returns true, iff the three points are collinear and q lies between p and r. | |
| template<typename Kernel > | |
| bool | CGAL::are_ordered_along_line (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r) |
returns true, iff the three points are collinear and q lies between p and r. | |
| bool CGAL::are_ordered_along_line | ( | const CGAL::Point_2< Kernel > & | p, |
| const CGAL::Point_2< Kernel > & | q, | ||
| const CGAL::Point_2< Kernel > & | r | ||
| ) |
#include <CGAL/Kernel/global_functions.h>
returns true, iff the three points are collinear and q lies between p and r.
Note that true is returned, if q==p or q==r.
| bool CGAL::are_ordered_along_line | ( | const CGAL::Point_3< Kernel > & | p, |
| const CGAL::Point_3< Kernel > & | q, | ||
| const CGAL::Point_3< Kernel > & | r | ||
| ) |
#include <CGAL/Kernel/global_functions.h>
returns true, iff the three points are collinear and q lies between p and r.
Note that true is returned, if q==p or q==r.