CGAL 4.7 - 2D Convex Hulls and Extreme Points: CGAL Namespace Reference

\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)

CGAL 4.7 - 2D Convex Hulls and Extreme Points

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Classes | Functions
CGAL Namespace Reference

## Classes

class | Convex_hull_constructive_traits_2
| The class `Convex_hull_constructive_traits_2` serves as a traits class for all the two-dimensional convex hull and extreme point calculation function. More...
class | Convex_hull_traits_2
| The class `Convex_hull_traits_2` serves as a traits class for all the two-dimensional convex hull and extreme point calculation function. More...

## Functions

template<class ForwardIterator , class OutputIterator , class Traits >
OutputIterator | ch_akl_toussaint (ForwardIterator first, ForwardIterator beyond, OutputIterator result, const Traits &ch_traits=Default_traits())
| generates the counterclockwise sequence of extreme points of the points in the range [`first`,`beyond`). More...
template<class InputIterator , class OutputIterator , class Traits >
OutputIterator | ch_bykat (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &ch_traits=Default_traits)
| generates the counterclockwise sequence of extreme points of the points in the range [`first`,`beyond`). More...
template<class InputIterator , class OutputIterator , class Traits >
OutputIterator | ch_eddy (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &ch_traits=Default_traits)
| generates the counterclockwise sequence of extreme points of the points in the range [`first`,`beyond`). More...
template<class InputIterator , class OutputIterator , class Traits >
OutputIterator | ch_graham_andrew (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &ch_traits=Default_traits)
| generates the counterclockwise sequence of extreme points of the points in the range [`first`,`beyond`). More...
template<class BidirectionalIterator , class OutputIterator , class Traits >
OutputIterator | ch_graham_andrew_scan (BidirectionalIterator first, BidirectionalIterator beyond, OutputIterator result, const Traits &ch_traits=Default_traits)
| generates the counterclockwise sequence of extreme points from a given sequence of input points that are not left of the line defined by the first and last points in this sequence. More...
template<class InputIterator , class OutputIterator , class Traits >
OutputIterator | ch_jarvis (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &ch_traits=Default_traits)
| generates the counterclockwise sequence of extreme points of the points in the range [`first`,`beyond`). More...
template<class ForwardIterator , class OutputIterator , class Traits >
OutputIterator | ch_jarvis_march (ForwardIterator first, ForwardIterator beyond, const Traits::Point_2 &start_p, const Traits::Point_2 &stop_p, OutputIterator result, const Traits &ch_traits=Default_traits)
| generates the counterclockwise sequence of extreme points from a given set of input points that line between two input points. More...
template<class InputIterator , class OutputIterator >
OutputIterator | ch_melkman (InputIterator first, InputIterator last, OutputIterator result, const Traits &ch_traits=Default_traits)
| generates the counterclockwise sequence of extreme points of the points in the range [`first`, `beyond`). More...
template<class ForwardIterator >
void | ch_e_point (ForwardIterator first, ForwardIterator beyond, ForwardIterator &e, const Traits &ch_traits=Default_traits)
| The function `ch_e_point()` finds a point of a given set of input points with maximal \( x\) coordinate. More...
template<class ForwardIterator >
void | ch_n_point (ForwardIterator first, ForwardIterator beyond, ForwardIterator &n, const Traits &ch_traits=Default_traits)
| The function `ch_n_point()` finds a point in a given set of input points with maximal \( y\) coordinate. More...
template<class ForwardIterator >
void | ch_ns_point (ForwardIterator first, ForwardIterator beyond, ForwardIterator &n, ForwardIterator &s, const Traits &ch_traits=Default_traits)
| The function `ch_ns_point()` finds the points of a given set of input points with minimal and maximal \( x\) coordinates. More...
template<class ForwardIterator >
void | ch_nswe_point (ForwardIterator first, ForwardIterator beyond, ForwardIterator &n, ForwardIterator &s, ForwardIterator &w, ForwardIterator &e, const Traits &ch_traits=Default_traits)
| The function `ch_nswe_point()` finds the four extreme points of a given set of input points using a linear scan of the input points. More...
template<class ForwardIterator >
void | ch_s_point (ForwardIterator first, ForwardIterator beyond, ForwardIterator &s, const Traits &ch_traits=Default_traits)
| The function `ch_s_point()` finds a points in a given set of input points with minimal \( y\) coordinates. More...
template<class ForwardIterator >
void | ch_we_point (ForwardIterator first, ForwardIterator beyond, ForwardIterator &w, ForwardIterator &e, const Traits &ch_traits=Default_traits)
| The function `ch_we_point()` finds two points of a given set of input points with minimal and maximal \( x\) coordinates. More...
template<class ForwardIterator >
void | ch_w_point (ForwardIterator first, ForwardIterator beyond, ForwardIterator &w, const Traits &ch_traits=Default_traits)
| The function `ch_w_point()` finds a point in a given set of input points with minimal \( x\) coordinate. More...
template<class InputIterator , class OutputIterator , class Traits >
OutputIterator | convex_hull_2 (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &ch_traits)
| generates the counterclockwise sequence of extreme points of the points in the range [`first`,`beyond`) with a user provided traits class. More...
template<class InputIterator , class OutputIterator >
OutputIterator | convex_hull_2 (InputIterator first, InputIterator beyond, OutputIterator result)
| generates the counterclockwise sequence of extreme points of the points in the range [`first`,`beyond`) using as traits class the kernel in which the point type is defined. More...
template<class InputIterator , class OutputIterator >
OutputIterator | lower_hull_points_2 (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &ch_traits=Default_traits)
| generates the counterclockwise sequence of extreme points on the lower hull of a given set of input points. More...
template<class InputIterator , class OutputIterator >
OutputIterator | upper_hull_points_2 (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &ch_traits=Default_traits)
| generates the counterclockwise sequence of extreme points on the upper hull of a given set of input points. More...
template<class ForwardIterator , class Traits >
bool | is_ccw_strongly_convex_2 (ForwardIterator first, ForwardIterator beyond, const Traits &ch_traits=Default_traits)
| The function `is_ccw_strongly_convex_2()` determines if a given sequence of points defines a counterclockwise-oriented, strongly convex polygon. More...
template<class ForwardIterator , class Traits >
bool | is_cw_strongly_convex_2 (ForwardIterator first, ForwardIterator beyond, const Traits &ch_traits=Default_traits)
| The function `is_cw_strongly_convex_2()` determines if a given sequence of points defines a clockwise-oriented, strongly convex polygon. More...