CGAL 6.1 - dD Geometry Kernel

Loading...
Searching...
No Matches
List of all members
Kernel_d::Contained_in_simplex_d Concept Reference
Reference Manual » Kernel Concept

## Definition

## Operations
A model of this concept must provide:
template<class ForwardIterator >
bool | operator() (ForwardIterator first, ForwardIterator last, const Kernel_d::Point_d &p)
| determines whether \( p\) is contained in the simplex of the points in `A = tuple [first,last)`.

## Member Function Documentation

## ◆ operator()()

template<class ForwardIterator >

bool Kernel_d::Contained_in_simplex_d::operator() | ( | ForwardIterator | first,
|  | ForwardIterator | last,
|  | const Kernel_d::Point_d & | p
| ) |  |

determines whether \( p\) is contained in the simplex of the points in `A = tuple [first,last)`.

Precondition
  The objects in \( A\) are of the same dimension and affinely independent.

Template Parameters

  ForwardIterator | has `Kernel_d::Point_d` as value type.