\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)
CGAL 4.9 - 2D and 3D Linear Geometry Kernel
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
List of all members
Kernel::LessRotateCCW_2 Concept Reference
Kernel Function Object Concepts

Definition

Refines:
AdaptableFunctor (with three arguments)

Operations

A model of this concept must provide:

bool operator() (const Kernel::Point_2 &p, const Kernel::Point_2 &q, const Kernel::Point_2 &r)
 returns true iff the three points p, q and r form a left turn or if they are collinear and the distance of q to p is larger than the distance of r to p, where p is the point passed to the object at construction. More...
 

Member Function Documentation

bool Kernel::LessRotateCCW_2::operator() ( const Kernel::Point_2 &  p,
const Kernel::Point_2 &  q,
const Kernel::Point_2 &  r 
)

returns true iff the three points p, q and r form a left turn or if they are collinear and the distance of q to p is larger than the distance of r to p, where p is the point passed to the object at construction.

Precondition
p does not lie in the interior of the segment rq, i.e. p is an extreme point with respect to \( \{p,q,r\}\).