CGAL 6.0 - 2D Convex Hulls and Extreme Points
Loading...
Searching...
No Matches
2D Convex Hulls and Extreme Points Reference

Susan Hert and Stefan Schirra
This package provides functions for computing convex hulls in two dimensions as well as functions for checking if sets of points are strongly convex are not. There are also a number of functions described for computing particular extreme points and subsequences of hull points, such as the lower and upper hull of a set of points.
Introduced in: CGAL 1.0
BibTeX: cgal:hs-chep2-24a
License: GPL
Windows Demo: See Bounding Volumes

A subset \(S \subseteq \mathbb{R}^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.

Classified Reference Pages

Assertions

For the convex hull algorithms, the postcondition check tests only convexity (if not disabled), but not containment of the input points in the polygon or polyhedron defined by the output points. The latter is considered an expensive checking and can be enabled by defining CGAL_CHECK_EXPENSIVE.

Concepts

Traits Classes

Convex Hull Functions

Convexity Checking Functions

Hull Subsequence Functions

Extreme Point Functions

Modules

 Concepts
 
 Traits Classes
 
 Convex Hull Functions
 
 Convexity Checking
 
 Hull Subsequence Functions
 
 Extreme Point Functions