|
CGAL provides functions for producing 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.
CGAL provides implementations of several classical algorithms for
computing the counterclockwise sequence of extreme points for a set of
points in two dimensions (i.e., the counterclockwise sequence of
points on the convex hull). The algorithms have different asymptotic
running times and require slightly different sets of geometric
primitives. Thus you may choose the algorithm that best fits your
setting.
| Functionality: | static |
| Robustness: | industry strong |
| License: | QPL, commercial |
| Developed by: | MPI |
|