The function ch_eddy generates the counterclockwise sequence of extreme points from a given set of input points.
#include <CGAL/ch_eddy.h>
 

 
generates the counterclockwise sequence of extreme points
of the points in the range [first,beyond).
The resulting sequence is placed starting at position
result, and the pasttheend iterator for the resulting
sequence is returned. It is not specified at which point the
cyclic sequence of extreme points is cut into a linear sequence. Precondition: The source range [first,beyond) does not contain result. 
The default traits class Default_traits is the kernel in which the type ForwardIterator::value_type is defined.
CGAL::ch_akl_toussaint
CGAL::ch_bykat
CGAL::ch_graham_andrew
CGAL::ch_jarvis
CGAL::ch_melkman
CGAL::convex_hull_2
This function implements Eddy's algorithm [Edd77], which is the twodimensional version of the quickhull algorithm [BDH96] . This algorithm requires $$O(n h) time in the worst case for $$n input points with $$h extreme points.