\( \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.8 - 3D Convex Hulls

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Classes | Functions
CGAL Namespace Reference

## Classes
class | Convex_hull_traits_3
| The class `Convex_hull_traits_3` serves as a traits class for the function `convex_hull_3()`. More...

## Functions
template<class PlaneIterator , class Polyhedron >
void | halfspace_intersection_3 (PlaneIterator begin, PlaneIterator end, Polyhedron &P, boost::optional< Polyhedron::Vertex::Point_3 > origin=boost::none)
| computes robustly the intersection of the halfspaces defined by the planes contained in the range [`begin`, `end`) without constructing the dual points. More...
template<class PlaneIterator , class Polyhedron , class Traits >
void | halfspace_intersection_with_constructions_3 (PlaneIterator pbegin, PlaneIterator pend, Polyhedron &P, boost::optional< Polyhedron::Vertex::Point_3 > origin=boost::none, const Traits &ch_traits=Default_traits)
| computes the intersection of the halfspaces defined by the planes contained in the range [`begin`, `end`). More...
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)
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...