CGAL 5.6  Bounding Volumes

#include <CGAL/Min_sphere_of_points_d_traits_3.h>
The class Min_sphere_of_points_d_traits_3<K,FT,UseSqrt,Algorithm>
is a model for concept MinSphereOfSpheresTraits
.
It uses the CGAL type Point_3
to represent spheres.
K  must be a model for Kernel . 
FT  is a number type, which fulfills the requirements of type FT of concept MinSphereOfSpheresTraits : It must be either double or float , or an exact number type. 
UseSqrt  fulfills the requirements of type Use_square_roots of concept MinSphereOfSpheresTraits : It must be either Tag_true or Tag_false , and it is by default CGAL::Tag_false . 
Algorithm  fulfills the requirements of type Algorithm of concept MinSphereOfSpheresTraits : It must be either Default_algorithm , LP_algorithm or Farthest_first_heuristic , and it is by default CGAL::Default_algorithm . 
Constants  
typedef unspecified_type  D 
is the constant 3, i.e. the dimension of \( \mathbb{R}^3\).  
Types  
In addition to the types required by the concept Here's the complete list of defined types:  
typedef unspecified_type  FT 
typedef unspecified_type  Use_square_roots 
typedef unspecified_type  Algorithm 
typedef unspecified_type  Radius 
is a typedef to the template parameter FT  
typedef unspecified_type  Point 
is a typedef to K::Point_3 .  
typedef unspecified_type  Sphere 
is a typedef to Point .  
typedef unspecified_type  Cartesian_const_iterator 
is a typedef to K::Cartesian_const_iterator_3 .  
Access Functions  
The class provides the access functions required by the concept  
FT  radius (const Sphere &s) 
returns 0 .  
Cartesian_const_iterator  center_cartesian_begin (const Sphere &s) 
maps to s.first.cartesian_begin() .  