#include <CGAL/Simple_cartesian.h>
#include <CGAL/point_generators_2.h>
#include <CGAL/Orthogonal_k_neighbor_search.h>
#include <CGAL/Search_traits_2.h>
#include <list>
#include <cmath>
typedef K::Point_2 Point_d;
typedef Neighbor_search::Tree Tree;
int main() {
const unsigned int N = 1;
std::list<Point_d> points;
points.push_back(Point_d(0,0));
Tree tree(points.begin(), points.end());
Point_d query(0,0);
Neighbor_search search(tree, query, N);
for(Neighbor_search::iterator it = search.begin(); it != search.end(); ++it){
std::cout << it->first <<
" "<<
std::sqrt(it->second) << std::endl;
}
return 0;
}