Navigation: Up, Table of Contents,  Short Table of Contents,  Package Overview,  Bibliography,  Index,  Title Page

CGAL::ch_s_point

Definition

The function ch_s_point finds a points in a given set of input points with minimal y coordinates.

#include <CGAL/ch_selected_extreme_points_2.h>

template <class ForwardIterator>
void
ch_s_point ( ForwardIterator first,
ForwardIterator beyond,
ForwardIterator& s,
Traits ch_traits = Default_traits)
traverses the range [first,beyond). After execution, the value of s is an iterator in the range such that *s yx *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 the type Traits::Less_yx_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_w_point
CGAL::ch_we_point

Next: ch_we_point
Navigation: Up, Table of Contents,  Short Table of Contents,  Package Overview,  Bibliography,  Index,  Title Page
CGAL Open Source Project. Release 3.2.1. 13 July 2006.