CGAL 4.7 - Bounding Volumes: Type Requirements

\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)

CGAL 4.7 - Bounding Volumes

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Type Requirements

Member CGAL::Approximate_min_ellipsoid_d< Traits >::Approximate_min_ellipsoid_d (double eps, Iterator first, Iterator last, const Traits &traits=Traits())
  `Iterator` must be a model for concept `InputIterator` with value type `Point`.
Member CGAL::Min_annulus_d< Traits >::center () const
  An implicit conversion from `ET` to `RT` is available.
Member CGAL::Min_annulus_d< Traits >::insert (InputIterator first, InputIterator last)
  The value type of `InputIterator` is `Point`.
Member CGAL::Min_annulus_d< Traits >::Min_annulus_d (InputIterator first, InputIterator last, const Traits &traits=Traits(), int verbose=0, std::ostream &stream=std::cout)
  The value type of `InputIterator` is `Point`.
Member CGAL::Min_annulus_d< Traits >::set (InputIterator first, InputIterator last)
  The value type of `InputIterator` is `Point`.
Member CGAL::Min_annulus_d< Traits >::squared_inner_radius () const
  An implicit conversion from `ET` to `RT` is available.
Member CGAL::Min_annulus_d< Traits >::squared_outer_radius () const
  An implicit conversion from `ET` to `RT` is available.
Member CGAL::Min_circle_2< Traits >::insert (InputIterator first, InputIterator last)
  The value type of `first` and `last` is `Point`.
Member CGAL::Min_circle_2< Traits >::Min_circle_2 (InputIterator first, InputIterator last, bool randomize, Random &random=CGAL::default_random, const Traits &traits=Traits())
  The value type of `first` and `last` is `Point`.
Member CGAL::Min_ellipse_2< Traits >::insert (InputIterator first, InputIterator last)
  The value type of `first` and `last` is `Point`.
Member CGAL::Min_ellipse_2< Traits >::Min_Ellipse_2 (InputIterator first, InputIterator last, bool randomize, Random &random=default_random, const Traits &traits=Traits())
  The value type of `first` and `last` is `Point`.
Member CGAL::min_parallelogram_2 (ForwardIterator points_begin, ForwardIterator points_end, OutputIterator o, Traits &t=Default_traits)
Member CGAL::min_rectangle_2 (ForwardIterator points_begin, ForwardIterator points_end, OutputIterator o, Traits &t=Default_traits)
Member CGAL::Min_sphere_d< Traits >::insert (InputIterator first, InputIterator last)
  The value type of `first` and `last` is `Point`.
Member CGAL::Min_sphere_d< Traits >::Min_sphere_d (InputIterator first, InputIterator last, const Traits &traits=Traits())
  The value type of `first` and `last` is `Point`. If the traits parameter is not supplied, the class `Traits` must provide a default constructor.
Member CGAL::Min_sphere_d< Traits >::set (InputIterator first, InputIterator last)
  The value type of `first` and `last` is `Point`.
Member CGAL::Min_sphere_of_spheres_d< Traits >::insert (InputIterator first, InputIterator last)
  The value type of `first` and `last` is `Sphere`.
Member CGAL::Min_sphere_of_spheres_d< Traits >::Min_sphere_of_spheres_d (InputIterator first, InputIterator last, const Traits &traits=Traits())
  The value type of `first` and `last` is `Sphere`. If the traits parameter is not supplied, the class `Traits` must provide a default constructor.
Member CGAL::Min_sphere_of_spheres_d< Traits >::set (InputIterator first, InputIterator last)
  The value type of `first` and `last` is `Sphere`.
Member CGAL::min_strip_2 (ForwardIterator points_begin, ForwardIterator points_end, OutputIterator o, Traits &t=Default_traits)
Member CGAL::rectangular_p_center_2 (ForwardIterator f, ForwardIterator l, OutputIterator o, FT &r, int p, const Traits &t=Default_traits)
Member MinSphereOfSpheresTraits::FT
  Currently, `FT` must either be `double` or `float`, or an exact field number type. (An exact number type is one which evaluates arithmetic expressions involving the four basic operations and comparisions with infinite precision, that is, like in \( \mathbb{R}\).)
Member operator<<
  The output operator is defined for `Point`.
Member operator<<
  The output operator is defined for `Point` (and for `Ellipse`, if pretty printing is used).
Member operator<<
  The output operator is defined for `Point` (and for `Circle`, if pretty printing is used).
Member operator<<
  The output operator is defined for `Point`.
Member operator>>
  The input operator is defined for `Point`.
Member operator>>
  The input operator is defined for `Point`.
Member operator>>
  The input operator is defined for `Point`.
Member operator>>
  The input operator is defined for `Point`.