// check that we can make queries on an empty rtree without error.
Rectangle testRect = new Rectangle(1,2,3,4);
Point testPoint = new Point(1,2);
Counter counter = new Counter();
rtree.intersects(testRect, counter);
assertTrue(counter.count == 0);
rtree.nearest(testPoint, counter, Float.MAX_VALUE);
assertTrue(counter.count == 0);