Navigation: Up   Table of Contents   Package Overview   Bibliography   Index   Title   Acknowledging CGAL
Function

CGAL::ch_we_point

Definition

The function ch_we_point finds two points of a given set of input points with minimal and maximal x coordinates.

#include <CGAL/ch_selected_extreme_points_2.h>

template <class ForwardIterator>
void
ch_we_point ( ForwardIterator first,
ForwardIterator beyond,
ForwardIterator& w,
ForwardIterator& e,
Traits ch_traits = Default_traits)
traverses the range [first,beyond). After execution, the value of w is an iterator in the range such that *w ≤ xy *it for all iterators it in the range. Similarly, for e the inequality *e ≥ xy *it holds for all iterators in the range.

The default traits class Default_traits is the kernel in which the type ForwardIterator::value_type is defined.

Requirements

Traits defines the type Traits::Less_xy_2 as specified in the concept ConvexHullTraits_2 and the corresponding member function that returns an instance of this type.

See Also

CGAL::ch_e_point
CGAL::ch_nswe_point
CGAL::ch_n_point
CGAL::ch_ns_point
CGAL::ch_s_point
CGAL::ch_w_point

Next: ch_w_point
Navigation: Up   Table of Contents   Package Overview   Bibliography   Index   Title   Acknowledging CGAL
CGAL Open Source Project. Release 4.0.1. 2 July 2012.