\( \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 5.0 - dD Geometry Kernel
List of all members
Kernel_d::Contained_in_simplex_d Concept Reference
dD Geometry Kernel Reference » Kernel Concept

Definition

Operations

A model of this concept must provide:

template<class ForwardIterator >
Bounded_side 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). More...
 

Member Function Documentation

◆ operator()()

template<class ForwardIterator >
Bounded_side 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
ForwardIteratorhas Kernel_d::Point_d as value type.