// 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.
//

/*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*
 * example2.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_3                        point;
typedef CGAL::Kdtree_interface_3d<point>  kd_interface;
typedef CGAL::Kdtree_d<kd_interface>      kd_tree;
typedef kd_tree::Box                      box;
typedef std::list<point>                  points_list;

//RANDOM FUNCTIONS
// dblRand - a random number between 0..1
#ifndef  RAND_MAX
#define  RAND_MAX    0x7fffffff
#endif

inline double dblRand( void )
{
    return (double)std::rand() / (double)RAND_MAX;
}

void random_points( int  num, points_list &l )
{
  double  x,y,z;

  for  (int j = 0;  j < num; j++)
    {
      x = dblRand()*10 ;
      y = dblRand()*10 ;
      z = dblRand()*10 ;
      point p(x,y,z);
      l.push_front(p);
    }
}

int main()
{
  CGAL::Kdtree_d<kd_interface>  tree(3);

  std::srand( (unsigned)time(NULL) );

  std::cout << "Choosing randomly 30 points in the cube (0,0,0)-(10,10,10)\n" ;

  points_list  l , res;
  random_points( 30, l);

  std::cout << "Listing of random points:\n" ;
  std::copy (l.begin(),l.end(),std::ostream_iterator<point>(std::cout,"\n") );
  std::cout << std::endl;

  // Building the tree for the random points
  tree.build( l );

  // Checking validity
  if  ( ! tree.is_valid() )
    tree.dump();
  assert( tree.is_valid() );

  // Searching the box r
  box r(point(2,2,2), point(7,7,7) ,3);
  tree.search( std::back_inserter( res ), r );

  std::cout << "Listing of the points in the box (2,2,2)-(7,7,7) : \n" ;
  std::copy (res.begin(),res.end(),std::ostream_iterator<point>(std::cout,"\n") );
  std::cout << std::endl;

  tree.delete_all();

  return 0;
}