KdTree t = new KdTree( );

void setup() {
  size(800, 800);
  background(255);


  System.out.println( "Starting program" );
  for ( int i = 0; i < 30; i++ )
  {
    Comparable [ ] it = new Comparable[ 2 ];
    it[ 0 ] = new Comparable( int(random(0, width)));
    it[ 1 ] = new Comparable( int(random(0, height)));
    t.insert( it );
  }

  Comparable [ ] low = new Comparable[ 2 ];
  Comparable [ ] high = new Comparable[ 2 ];

//  low[ 0 ] = new Comparable( width/2 );
//  low[ 1 ] = new Comparable( 0 );
//
//  high[ 0 ] = new Comparable( width );
//  high[ 1 ] = new Comparable( height );
  low[ 0 ] = new Comparable( 0 );
  low[ 1 ] = new Comparable( 0 );

  high[ 0 ] = new Comparable( width );
  high[ 1 ] = new Comparable( height );
  
  t.printRange( low, high );
 
}


void draw() {

      Comparable [ ] low = new Comparable[ 2 ];
  Comparable [ ] high = new Comparable[ 2 ];

  low[ 0 ] = new Comparable( width/2 );
  low[ 1 ] = new Comparable( 0 );

  high[ 0 ] = new Comparable( width );
  high[ 1 ] = new Comparable( height );
  
  t.drawRange(low, high);
//  t.draw();
}