|
CGAL 6.0 - Spatial Sorting
|
#include <CGAL/Multiscale_sort.h>
The class Multiscale_sort represents a sorting algorithm adaptor.
Given a range of n points:
Sort on the last (1 - ratio) * n points, ratio * n points, stopping when there are fewer than threshold points. Creation | |
| Multiscale_sort (const Sort &sort=Sort(), std::ptrdiff_t threshold=1, double ratio=0.5) | |
constructs an instance with traits as traits class instance. | |
Operations | |
| template<class InputIterator > | |
| void | operator() (InputIterator begin, InputIterator end) const |
sorts the range [begin, end). | |
| void CGAL::Multiscale_sort< Sort >::operator() | ( | InputIterator | begin, |
| InputIterator | end | ||
| ) | const |
sorts the range [begin, end).
Sort::operator()(InputIterator begin, InputIterator end) must be defined.