CGAL::hilbert_sort
Definition
The function hilbert_sort sorts an iterator range of points
along a Hilbert curve.
#include <CGAL/hilbert_sort.h>
|
template <class RandomAccessIterator, class Traits, class PolicyTag>
|
|
void
|
|
hilbert_sort ( |
RandomAccessIterator begin,
RandomAccessIterator end,
Traits traits = Default_traits,
PolicyTag policy = Default_policy) |
|
sorts the range [begin,end) in place.
The default traits class Default_traits is the kernel in which the type
RandomAccessIterator::value_type is defined.
The default policy is Hilbert_sort_median_policy() and the
other option is Hilbert_sort_middle_policy().
Requirements
- RandomAccessIterator::value_type is convertible to
Traits::Point_2, Traits::Point_3, or Traits::Point_d.
- Traits is a model for concept SpatialSortingTraits_2,
SpatialSortingTraits_3, or SpatialSortingTraits_d.
Implementation
Creates an instance of
Hilbert_sort_2<Traits, PolicyTag>,
Hilbert_sort_3<Traits, PolicyTag>, or
Hilbert_sort_d<Traits, PolicyTag>
and calls its operator().
