CGAL Namespace Reference

Classes
class	Approximate_min_ellipsoid_d
	An object of class Approximate_min_ellipsoid_d is an approximation to the ellipsoid of smallest volume enclosing a finite multiset of points in \( d\)-dimensional Euclidean space \( \E^d\), \( d\ge 2\). More...
struct	Approximate_min_ellipsoid_d_traits_2
	The class Approximate_min_ellipsoid_d_traits_2 is a traits class for CGAL::Approximate_min_ellipsoid_d<Traits> using the 2-dimensional CGAL kernel. More...
struct	Approximate_min_ellipsoid_d_traits_3
	The class Approximate_min_ellipsoid_d_traits_3 is a traits class for CGAL::Approximate_min_ellipsoid_d<Traits> using the 3-dimensional CGAL kernel. More...
struct	Approximate_min_ellipsoid_d_traits_d
	The class Approximate_min_ellipsoid_d_traits_d is a traits class for CGAL::Approximate_min_ellipsoid_d<Traits> using the d-dimensional CGAL kernel. More...
class	Min_annulus_d
	An object of the class Min_annulus_d is the unique annulus (region between two concentric spheres with radii \( r\) and \( R\), \( r \leq R\)) enclosing a finite set of points in \( d\)-dimensional Euclidean space \( \E^d\), where the difference \( R^2-r^2\) is minimal. More...
class	Min_circle_2
	An object of the class Min_circle_2 is the unique circle of smallest area enclosing a finite (multi)set of points in two-dimensional Euclidean space \( \E^2\). More...
class	Min_circle_2_traits_2
	The class Min_circle_2_traits_2 is a traits class for Min_circle_2<Traits> using the two-dimensional CGAL kernel. More...
class	Min_ellipse_2
	An object of the class Min_ellipse_2 is the unique ellipse of smallest area enclosing a finite (multi)set of points in two-dimensional euclidean space \( \E^2\). More...
class	Min_ellipse_2_traits_2
	The class Min_ellipse_2_traits_2 is a traits class for CGAL::Min_ellipse_2<Traits> using the two-dimensional CGAL kernel. More...
struct	Min_quadrilateral_default_traits_2
	The class Min_quadrilateral_default_traits_2 is a traits class for the functions min_rectangle_2(), min_parallelogram_2() and min_strip_2() using a two-dimensional CGAL kernel. More...
class	Min_sphere_annulus_d_traits_2
	The class Min_sphere_annulus_d_traits_2 is a traits class for the \( d\)-dimensional optimization algorithms using the two-dimensional CGAL kernel. More...
class	Min_sphere_annulus_d_traits_3
	The class Min_sphere_annulus_d_traits_3 is a traits class for the \( d\)-dimensional optimization algorithms using the three-dimensional CGAL kernel. More...
class	Min_sphere_annulus_d_traits_d
	The class Min_sphere_annulus_d_traits_d is a traits class for the \( d\)-dimensional optimization algorithms using the \( d\)-dimensional CGAL kernel. More...
class	Min_sphere_d
	An object of the class Min_sphere_d is the unique sphere of smallest volume enclosing a finite (multi)set of points in \( d\)-dimensional Euclidean space \( \E^d\). More...
class	Min_sphere_of_points_d_traits_2
	The class Min_sphere_of_points_d_traits_2<K,FT,UseSqrt,Algorithm> is a model for concept MinSphereOfSpheresTraits. More...
class	Min_sphere_of_points_d_traits_3
	The class Min_sphere_of_points_d_traits_3<K,FT,UseSqrt,Algorithm> is a model for concept MinSphereOfSpheresTraits. More...
class	Min_sphere_of_points_d_traits_d
	The class Min_sphere_of_points_d_traits_d<K,FT,Dim,UseSqrt,Algorithm> is a model for concept MinSphereOfSpheresTraits. More...
class	Min_sphere_of_spheres_d
	An object of the class Min_sphere_of_spheres_d is a data structure that represents the unique sphere of smallest volume enclosing a finite set of spheres in \( d\)-dimensional Euclidean space \( \E^d\). More...
class	Min_sphere_of_spheres_d_traits_2
	The class Min_sphere_of_spheres_d_traits_2<K,FT,UseSqrt,Algorithm> is a model for concept MinSphereOfSpheresTraits. More...
class	Min_sphere_of_spheres_d_traits_3
	The class Min_sphere_of_spheres_d_traits_3<K,FT,UseSqrt,Algorithm> is a model for concept MinSphereOfSpheresTraits. More...
class	Min_sphere_of_spheres_d_traits_d
	The class Min_sphere_of_spheres_d_traits_d<K,FT,Dim,UseSqrt,Algorithm> is a model for concept MinSphereOfSpheresTraits. More...
class	Rectangular_p_center_default_traits_2
	The class Rectangular_p_center_default_traits_2 defines types and operations needed to compute rectilinear \( p\)-centers of a planar point set using the function rectangular_p_center_2(). More...

Functions
template<class ForwardIterator , class OutputIterator , class Traits >
OutputIterator	min_parallelogram_2 (ForwardIterator points_begin, ForwardIterator points_end, OutputIterator o, Traits &t=Default_traits)
	computes a minimum area enclosing parallelogram of the point set described by [points_begin, points_end), writes its vertices (counterclockwise) to o and returns the past-the-end iterator of this sequence.
template<class ForwardIterator , class OutputIterator , class Traits >
OutputIterator	min_rectangle_2 (ForwardIterator points_begin, ForwardIterator points_end, OutputIterator o, Traits &t=Default_traits)
	computes a minimum area enclosing rectangle of the point set described by [points_begin, points_end), writes its vertices (counterclockwise) to o, and returns the past-the-end iterator of this sequence.
template<class ForwardIterator , class OutputIterator , class Traits >
OutputIterator	min_strip_2 (ForwardIterator points_begin, ForwardIterator points_end, OutputIterator o, Traits &t=Default_traits)
	computes a minimum enclosing strip of the point set described by [points_begin, points_end), writes its two bounding lines to o and returns the past-the-end iterator of this sequence.
template<class ForwardIterator , class OutputIterator , class FT , class Traits >
OutputIterator	rectangular_p_center_2 (ForwardIterator f, ForwardIterator l, OutputIterator o, FT &r, int p, const Traits &t=Default_traits)
	Computes rectilinear \( p\)-centers of a planar point set, i.e. a set of \( p\) points such that the maximum minimal \( L_{\infty}\)-distance between both sets is minimized.