CGAL 4.14 - Spatial Sorting
|
#include <CGAL/Hilbert_sort_3.h>
The function object Hilbert_sort_3
sorts iterator ranges of Traits::Point_3
along a Hilbert curve by recursively subdividing at the median or the middle depending on the PolicyTag
.
Traits | must be a model for SpatialSortingTraits_3 . |
Creation | |
Hilbert_sort_3 (const Traits &traits=Traits()) | |
constructs an instance with traits as traits class instance. | |
Operations | |
template<class RandomAccessIterator > | |
void | operator() (RandomAccessIterator begin, RandomAccessIterator end) const |
It sorts the range [begin, end) . More... | |
void CGAL::Hilbert_sort_3< Traits, PolicyTag >::operator() | ( | RandomAccessIterator | begin, |
RandomAccessIterator | end | ||
) | const |
It sorts the range [begin, end)
.
RandomAccessIterator | must be an iterator with value type Traits::Point_3 . |