for ( int i = 0; i < numPoints; ++i )
{
for ( int d = 0; d < numDimensions; ++d )
p[ d ] = rnd.nextFloat() * size + min;
final RealPoint t = new RealPoint( p );
points.add( t );
}
final double radius = rnd.nextDouble() * size / 10;
long start = System.currentTimeMillis();
final KDTree< RealPoint > kdTree = new KDTree< RealPoint >( points, points );
final RadiusNeighborSearchOnKDTree< RealPoint > kd = new RadiusNeighborSearchOnKDTree< RealPoint >( kdTree );
final long kdSetupTime = System.currentTimeMillis() - start;
System.out.println( "kdtree setup took: " + ( kdSetupTime ) + " ms." );
start = System.currentTimeMillis();
final ArrayList< RealPoint > testpoints = new ArrayList< RealPoint >();
for ( int i = 0; i < numTests; ++i )
{
for ( int d = 0; d < numDimensions; ++d )
p[ d ] = rnd.nextFloat() * 2 * size + min - size / 2;
final RealPoint t = new RealPoint( p );
testpoints.add( t );
}
for ( final RealPoint t : testpoints )
{