mirror of https://github.com/CGAL/cgal
81 lines
2.1 KiB
C++
81 lines
2.1 KiB
C++
// Copyright (c) 1997 Tel-Aviv University (Israel).
|
|
// All rights reserved.
|
|
//
|
|
// This file is part of an example program for CGAL. This example
|
|
// program may be used, distributed and modified without limitation.
|
|
//
|
|
|
|
/*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*
|
|
* example1.C -
|
|
* Simple example the CGAL KD-tree module.
|
|
*
|
|
* Written by Sariel Har-Peled
|
|
* Iddo Hanniel
|
|
\*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*/
|
|
|
|
#include <CGAL/Cartesian.h>
|
|
|
|
#include <iostream>
|
|
#include <iterator>
|
|
#include <ctime>
|
|
#include <cassert>
|
|
#include <cstdlib>
|
|
#include <list>
|
|
|
|
#include <CGAL/kdtree_d.h>
|
|
|
|
typedef CGAL::Cartesian<double> K;
|
|
typedef K::Point_2 point;
|
|
typedef CGAL::Kdtree_interface_2d<point> kd_interface;
|
|
typedef CGAL::Kdtree_d<kd_interface> kd_tree;
|
|
typedef kd_tree::Box box;
|
|
typedef std::list<point> points_list;
|
|
|
|
int main()
|
|
{
|
|
CGAL::Kdtree_d<kd_interface> tree(2);
|
|
points_list l, res;
|
|
|
|
std::srand( (unsigned)time(NULL) );
|
|
|
|
std::cout << "Insering evenly 81 points in the square (0,0)-(10,10) ...\n\n";
|
|
for (int i=1; i<10; i++)
|
|
for (int j=1; j<10; j++)
|
|
{
|
|
point p(i,j);
|
|
l.push_front(p);
|
|
}
|
|
|
|
// building the tree
|
|
tree.build( l );
|
|
|
|
// checking validity
|
|
if ( ! tree.is_valid() )
|
|
tree.dump();
|
|
assert( tree.is_valid() );
|
|
|
|
// Defining and searching the box r
|
|
double lx,ly,rx,ry;
|
|
std::cout << "Define your query square.\nEnter left x coordinate: " ;
|
|
std::cin >> lx ;
|
|
std::cout << "Enter left y coordinate: ";
|
|
std::cin >> ly;
|
|
std::cout << "Enter right x coordinate: " ;
|
|
std::cin >> rx ;
|
|
std::cout << "Enter right y coordinate: ";
|
|
std::cin >> ry;
|
|
std::cout << std::endl;
|
|
|
|
box r(point(lx,ly), point(rx,ry) ,2);
|
|
|
|
tree.search( std::back_inserter( res ), r );
|
|
|
|
std::cout << "Listing of the points in the square: \n" ;
|
|
std::copy (res.begin(),res.end(),std::ostream_iterator<point>(std::cout," \n") );
|
|
std::cout << std::endl;
|
|
|
|
tree.delete_all();
|
|
|
|
return 0;
|
|
}
|