CGAL Namespace Reference

Classes
class	Polytope_distance_d
	An object of the class Polytope_distance_d represents the (squared) distance between two convex polytopes, given as the convex hulls of two finite point sets in \( d\)-dimensional Euclidean space \( \E^d\). More...
class	Polytope_distance_d_traits_2
	The class Polytope_distance_d_traits_2 is a traits class for the \( d\)-dimensional optimization algorithms using the two-dimensional CGAL kernel. More...
class	Polytope_distance_d_traits_3
	The class Polytope_distance_d_traits_3 is a traits class for the \( d\)-dimensional optimization algorithms using the three-dimensional CGAL kernel. More...
class	Polytope_distance_d_traits_d
	The class Polytope_distance_d_traits_d is a traits class for the \( d\)-dimensional optimization algorithms using the \( d\)-dimensional CGAL kernel. More...
class	Width_3
	Given a set of points \( \mathcal{S}=\left\{p_1,\ldots , p_n\right\}\) in \( \mathbb{R}^3\). More...
class	Width_default_traits_3
	The class Width_default_traits_3 is a traits class for Width_3<Traits> using the three-dimensional CGAL kernel. More...

Functions
template<class RandomAccessIterator , class OutputIterator , class Traits >
OutputIterator	all_furthest_neighbors_2 (RandomAccessIterator points_begin, RandomAccessIterator points_end, OutputIterator o, Traits t=Default_traits)
	computes all furthest neighbors for the vertices of the convex polygon described by the range [points_begin, points_end), writes their indices (relative to points_begin) to othe furthest neighbor of points_begin[i] is points_begin[i-th number written to o] and returns the past-the-end iterator of this sequence.