Processing math: 100%
CGAL 4.7 - dD Geometry Kernel
•All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
List of all members
Kernel_d::Affine_rank_d Concept Reference
Kernel Concept

Definition

Operations

A model of this concept must provide:

template<class ForwardIterator >
int operator() (ForwardIterator first, ForwardIterator last)
 computes the affine rank of the points in A = tuple [first,last). More...
 

Member Function Documentation

template<class ForwardIterator >
int Kernel_d::Affine_rank_d::operator() ( ForwardIterator  first,
ForwardIterator  last 
)

computes the affine rank of the points in A = tuple [first,last).

Precondition
The objects are of the same dimension.
Requires:
The value type of ForwardIterator is Kernel_d::Point_d.