Kernel::Contained_in_simplex_d

A model for this must provide:

template <class ForwardIterator>
Bounded_side fo ( ForwardIterator first , ForwardIterator last , Kernel::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.
Requirement: The value type of ForwardIterator is Kernel::Point_d.