CGAL::ch_e_point
Definition
The function ch_e_point finds a point of a given set
of input points with maximal x coordinate.
#include <CGAL/ch_selected_extreme_points_2.h>
|
template <class ForwardIterator>
|
|
void
|
|
ch_e_point ( |
ForwardIterator first,
ForwardIterator beyond,
ForwardIterator& e,
Traits ch_traits = Default_traits) |
|
| |
traverses the range [first,beyond).
After execution, the value of
e is an iterator in the range such that *e ≥ xy
*it for all iterators it in the range.
|
The default traits class Default_traits is the kernel in which the
type ForwardIterator::value_type is defined.
Requirements
Traits defines a type Traits::Less_xy_2 as described in
the concept ConvexHullTraits_2 and the corresponding member
function that returns an instance of this type.
See Also
CGAL::ch_nswe_point
CGAL::ch_n_point
CGAL::ch_ns_point
CGAL::ch_s_point
CGAL::ch_w_point
CGAL::ch_we_point
