1 package edu.berkeley.qfat.geom;
2 import javax.media.opengl.*;
4 import com.infomatiq.jsi.*;
5 import com.infomatiq.jsi.rtree.*;
7 public class RTree<V extends HasBoundingBox> implements Iterable<V> {
9 private com.infomatiq.jsi.rtree.RTree rtree =
10 new com.infomatiq.jsi.rtree.RTree();
13 HashMap<Integer, V> idToV = new HashMap<Integer, V>();
14 HashMap<V, Integer> vToId = new HashMap<V, Integer>();
16 public Iterator<V> iterator() { return vToId.keySet().iterator(); }
19 Properties props = new Properties();
20 props.put("MinNodeEntries", "1");
21 props.put("MaxNodeEntries", "5");
25 public void add(V v) { insert(v); }
26 public void insert(V v) {
30 rtree.add(new com.infomatiq.jsi.Rectangle(v.getMinX(), v.getMinY(), v.getMinZ(),
31 v.getMaxX(), v.getMaxY(), v.getMaxZ()),
35 public void remove(V v) {
36 Integer idi = vToId.get(v);
37 if (idi==null) return;
41 rtree.delete(new com.infomatiq.jsi.Rectangle(v.getMinX(), v.getMinY(), v.getMinZ(),
42 v.getMaxX(), v.getMaxY(), v.getMaxZ()),
48 private IntProcedure finder = new IntProcedure() {
49 public boolean execute(int id) {
50 found = idToV.get(id);
55 public V nearest(Point p) {
56 rtree.nearest(new com.infomatiq.jsi.Point(p.x, p.y, p.z), finder, Float.POSITIVE_INFINITY);
62 Visitor<V> visitor = null;
63 private IntProcedure searcher = new IntProcedure() {
64 public boolean execute(int id) {
70 public void range(HasBoundingBox v, Visitor vis) {
72 rtree.intersects(new com.infomatiq.jsi.Rectangle(v.getMinX(), v.getMinY(), v.getMinZ(),
73 v.getMaxX(), v.getMaxY(), v.getMaxZ()),