|
template<class InputIterator , class Polyhedron_3 , class Traits > |
void | convex_hull_3 (InputIterator first, InputIterator last, Polyhedron_3 &P, const Traits &ch_traits=Default_traits) |
| computes the convex hull of the set of points in the range [first , last ). More...
|
|
template<class InputIterator , class Traits > |
void | convex_hull_3 (InputIterator first, InputIterator last, Object &ch_object, const Traits &ch_traits=Default_traits) |
| computes the convex hull of the set of points in the range [first , last ). More...
|
|
template<class Triangulation , class Polyhedron > |
void | convex_hull_3_to_polyhedron_3 (const Triangulation &T, Polyhedron &P) |
| fills a polyhedron with the convex hull of a set of 3D points contained in a 3D triangulation of CGAL. More...
|
|
template<class InputIterator , class Polyhedron > |
void | convex_hull_incremental_3 (InputIterator first, InputIterator beyond, Polyhedron &P, bool test_correctness=false) |
| computes the convex hull polyhedron of the three-dimensional points in the range [first ,beyond ) and assigns it to P . More...
|
|
template<class Polyhedron , class Traits > |
bool | is_strongly_convex_3 (Polyhedron &P, const Traits &traits=Default_traits) |
| determines if the vertices of a given polyhedron represents a strongly convex set of points or not. More...
|
|