CGAL 5.1 - dD Geometry Kernel
Kernel_d::Contained_in_simplex_d Class Reference

#include <Concepts/Kernel--Contained_in_simplex_d.h>

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.