A subset S ⊆ ℝ2 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 polygon 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 dimensions as well as functions for testing if a given set of points is strongly convex or not. There are also a number of functions available for computing particular extreme points in 2D and subsequences of the hull points, such as the lower hull or upper hull of a set of points.
CGAL::Convex_hull_constructive_traits_2<R>
CGAL::Convex_hull_projective_xy_traits_2<Point_3>
CGAL::Convex_hull_projective_xz_traits_2<Point_3>
CGAL::Convex_hull_projective_yz_traits_2<Point_3>
CGAL::Convex_hull_traits_2<R>
CGAL::ch_akl_toussaint
CGAL::ch_bykat
CGAL::ch_eddy
CGAL::ch_graham_andrew
CGAL::ch_jarvis
CGAL::ch_melkman
CGAL::convex_hull_2
CGAL::is_ccw_strongly_convex_2
CGAL::is_cw_strongly_convex_2
CGAL::ch_graham_andrew_scan
CGAL::ch_jarvis_march
CGAL::lower_hull_points_2
CGAL::upper_hull_points_2
CGAL::ch_e_point
CGAL::ch_nswe_point
CGAL::ch_n_point
CGAL::ch_ns_point
CGAL::ch_s_point
CGAL::ch_w_point
CGAL::ch_we_point