\( \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 - Optimal Distances
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Type Requirements
Member CGAL::Polytope_distance_d< Traits >::insert (InputIterator1 p_first, InputIterator1 p_last, InputIterator2 q_first, InputIterator2 q_last)
The value type of InputIterator1 and InputIterator2 is Point.
Precondition
All points have the same dimension. If poly_dist is not \( pd(\emptyset, \emptyset)\), this dimension must be equal to poly_dist.ambient_dimension().
Member CGAL::Polytope_distance_d< Traits >::insert_p (InputIterator p_first, InputIterator p_last)
The value type of InputIterator is Point.
Precondition
All points have the same dimension. If poly_dist is not empty, this dimension must be equal to poly_dist.ambient_dimension().
Member CGAL::Polytope_distance_d< Traits >::insert_q (InputIterator q_first, InputIterator q_last)
The value type of InputIterator is Point.
Precondition
All points have the same dimension. If poly_dist is not empty, this dimension must be equal to poly_dist.ambient_dimension().
Member CGAL::Polytope_distance_d< Traits >::Polytope_distance_d (InputIterator1 p_first, InputIterator1 p_last, InputIterator2 q_first, InputIterator2 q_last, const Traits &traits=Traits(), int verbose=0, std::ostream &stream=std::cout)
The value type of InputIterator1 and InputIterator2 is Point.
Precondition
All points have the same dimension.
Member CGAL::Polytope_distance_d< Traits >::realizing_point_p () const
An implicit conversion from ET to RT is available.
Precondition
\( pd(P,Q)\) is finite.
Member CGAL::Polytope_distance_d< Traits >::realizing_point_q () const
An implicit conversion from ET to RT is available.
Precondition
\( pd(P,Q)\) is finite.
Member CGAL::Polytope_distance_d< Traits >::set (InputIterator1 p_first, InputIterator1 p_last, InputIterator2 q_first, InputIterator2 q_last)
The value type of InputIterator1 and InputIterator2 is Point.
Precondition
All points have the same dimension.
Member CGAL::Polytope_distance_d< Traits >::set_p (InputIterator p_first, InputIterator p_last)
The value type of InputIterator is Point.
Precondition
All points in \( P\) have dimension poly_dist.ambient_dimension() if \( Q\) is not empty.
Member CGAL::Polytope_distance_d< Traits >::set_q (InputIterator q_first, InputIterator q_last)
The value type of InputIterator is Point.
Precondition
All points in \( Q\) have dimension poly_dist.ambient_dimension() if \( P\) is not empty.
Member CGAL::Polytope_distance_d< Traits >::squared_distance () const
An implicit conversion from ET to RT is available.
Precondition
\( pd(P,Q)\) is finite.
Member CGAL::Width_3< Traits >::Width_3 (Polyhedron &P)
Polyhedron is a CGAL::Polyhedron_3 with facets supporting plane equations where Polyhedron::Point_3 \( \equiv\) Point_3 and Polyhedron::Plane_3 \( \equiv\) Plane_3.
Member CGAL::Width_3< Traits >::Width_3 (InputIterator first, InputIterator beyond)
The value type of InputIterator is Point_3.
Member operator<<

The output operator is defined for Point_d.

Member operator>>

The input operator is defined for Point_d.