See also: CGAL::are_ordered_along_line(); CGAL::are_strictly_ordered_along_line(); CGAL::collinear_are_strictly_ordered_along_line()

Functions
template<typename Kernel>
bool	CGAL::collinear_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 q lies between p and r.
template<typename Kernel>
bool	CGAL::collinear_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 q lies between p and r.

Function Documentation

◆ collinear_are_ordered_along_line() [1/2]

template<typename Kernel>

bool CGAL::collinear_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 q lies between p and r.

template<typename Kernel>

bool CGAL::collinear_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 q lies between p and r.