#include <CGAL/Hilbert_sort_d.h>
The function object Hilbert_sort_d
sorts iterator ranges of Traits::Point_d
along a Hilbert curve by recursively subdividing at the median or the middle depending on the PolicyTag
.
- Template Parameters
-
|
| Hilbert_sort_d (const Traits &traits=Traits()) |
| constructs an instance with traits as traits class instance.
|
|
|
template<class InputPointIterator > |
void | operator() (InputPointIterator begin, InputPointIterator end) const |
| It sorts the range [begin, end) . More...
|
|
◆ operator()()
template<typename Traits , typename PolicyTag >
template<class InputPointIterator >
void CGAL::Hilbert_sort_d< Traits, PolicyTag >::operator() |
( |
InputPointIterator |
begin, |
|
|
InputPointIterator |
end |
|
) |
| const |
It sorts the range [begin, end)
.
- Template Parameters
-