CGAL::are_strictly_ordered_along_line()

See also

CGAL::are_ordered_along_line()

CGAL::collinear_are_ordered_along_line()

CGAL::collinear_are_strictly_ordered_along_line()

Functions
template<typename Kernel >
bool	CGAL::are_strictly_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 strictly between p and r. More...
template<typename Kernel >
bool	CGAL::are_strictly_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 strictly between p and r. More...

Function Documentation

are_strictly_ordered_along_line() [1/2]

template<typename Kernel >

bool CGAL::are_strictly_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 strictly between p and r.

Note that false is returned, if q==p or q==r.

are_strictly_ordered_along_line() [2/2]

template<typename Kernel >

bool CGAL::are_strictly_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 strictly between p and r.

Note that false is returned, if q==p or q==r.