CGAL 6.1.2 - Spatial Sorting: Spatial_sorting/hilbert.cpp

CGAL 6.1.2 - Spatial Sorting

Loading...
Searching...
No Matches
Spatial_sorting/hilbert.cpp
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/point_generators_2.h>
#include <CGAL/hilbert_sort.h>
#include <iostream>
#include <vector>
typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
typedef K::Point_2 Point;
typedef CGAL::Creator_uniform_2<double,Point> Creator;
int main ()
{
std::size_t size = 16;
std::vector<Point> v; v.reserve(size);
CGAL::points_on_square_grid_2(3.0, size, // generate points
std::back_inserter(v), Creator());
CGAL::hilbert_sort (v.begin(), v.end()); // sort
for(std::size_t i=0; i<size; ++i)std::cout<<v[i]<<std::endl;//output
return 0;
}
CGAL::Creator_uniform_2
CGAL::Exact_predicates_inexact_constructions_kernel
CGAL::hilbert_sort
void hilbert_sort(InputPointIterator begin, InputPointIterator end, const Traits &traits=Default_traits, PolicyTag policy=Default_policy)
The function hilbert_sort() sorts an iterator range of points along a Hilbert curve.