X-Git-Url: http://git.megacz.com/?p=anneal.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fqfat%2Fgeom%2FRTree.java;fp=src%2Fedu%2Fberkeley%2Fqfat%2Fgeom%2FRTree.java;h=1e6e39a3e1cc9aea626fe8dcabc813f89d3f21e1;hp=35b6f9b03d89e902c4695a33e5b7f2edf0b940ce;hb=134533b4f701c44cf69b2c08bedf4ae7b5beba0b;hpb=fa493c7d6f06f51cd29354d02c69b7456609dd92

diff --git a/src/edu/berkeley/qfat/geom/RTree.java b/src/edu/berkeley/qfat/geom/RTree.java
index 35b6f9b..1e6e39a 100644
--- a/src/edu/berkeley/qfat/geom/RTree.java
+++ b/src/edu/berkeley/qfat/geom/RTree.java
@@ -65,6 +65,14 @@ public class RTree<V extends HasBoundingBox> implements Iterable<V> {
 
     public void range(HasBoundingBox v, Visitor vis) {
         visitor = vis;
+        rect.set(v.getMinX(), v.getMinY(), v.getMinZ(), v.getMaxX(), v.getMaxY(), v.getMaxZ());
+        rtree.intersects(rect, myIntProcedure);
+        visitor = null;
+    }
+
+    public void range(Point p1, Point p2, Visitor vis) {
+        visitor = vis;
+        rect.set(p1.x, p1.y, p1.z, p2.x, p2.y, p2.z);
         rtree.intersects(rect, myIntProcedure);
         visitor = null;
     }