CGAL 5.5.2  2D Convex Hulls and Extreme Points

Concepts  
concept  ConvexHullTraits_2 
All convex hull and extreme point algorithms provided in CGAL are parameterized with a traits class Traits , which defines the primitives (objects and predicates) that the convex hull algorithms use. ConvexHullTraits_2 defines the complete set of primitives required in these functions. The specific subset of these primitives required by each function is specified with each function. More...  