CGAL 4.7 - Optimal Distances
|
InputIterator1
and InputIterator2
is Point
. poly_dist
is not \( pd(\emptyset, \emptyset)\), this dimension must be equal to poly_dist
.ambient_dimension()
. InputIterator
is Point
. poly_dist
is not empty, this dimension must be equal to poly_dist
.ambient_dimension()
. InputIterator
is Point
. poly_dist
is not empty, this dimension must be equal to poly_dist
.ambient_dimension()
. InputIterator1
and InputIterator2
is Point
. ET
to RT
is available. ET
to RT
is available. InputIterator1
and InputIterator2
is Point
. InputIterator
is Point
. poly_dist
.ambient_dimension()
if \( Q\) is not empty. InputIterator
is Point
. poly_dist
.ambient_dimension()
if \( P\) is not empty. ET
to RT
is available. 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
. InputIterator
is Point_3
. The output operator is defined for Point_d
.
The input operator is defined for Point_d
.