A subset S ⊆ ℝ^{3} is convex if for any two points p and q
in the set the line segment with endpoints p and q is contained
in S. The convex hull
of a set S is
the smallest convex set containing
S. The convex hull of a set of points P is a convex
polytope with vertices in P. A point in P is an extreme point
(with respect to P)
if it is a vertex
of the convex hull of P.

Cgal provides functions for computing convex hulls in two, three and arbitrary dimensions as well as functions for testing if a given set of points in is strongly convex or not. This chapter describes the class available for arbitrary dimensions and its companion class for computing the nearest and furthest side Delaunay triangulation.

*ConvexHullTraits_d*

*DelaunayLiftedTraits_d*

*DelaunayTraits_d*

*CGAL::Convex_hull_d_traits_3<R>*

*CGAL::Convex_hull_d<R>*

*CGAL::Delaunay_d< R, Lifted_R >*

ConvexHullTraits_d |

Convex_hull_d<R> |

Convex_hull_d_traits_3<R> |

DelaunayLiftedTraits_d |

DelaunayTraits_d |

Delaunay_d< R, Lifted_R > |

CGAL Open Source Project.
Release 3.5.
1 October 2009.