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> {
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>();
17 Properties props = new Properties();
18 props.put("MinNodeEntries", "1");
19 props.put("MaxNodeEntries", "5");
23 public void add(V v) { insert(v); }
24 public void insert(V v) {
28 rtree.add(new com.infomatiq.jsi.Rectangle(v.getMinX(), v.getMinY(), v.getMinZ(),
29 v.getMaxX(), v.getMaxY(), v.getMaxZ()),
33 public void remove(V v) {
34 Integer idi = vToId.get(v);
35 if (idi==null) return;
39 rtree.delete(new com.infomatiq.jsi.Rectangle(v.getMinX(), v.getMinY(), v.getMinZ(),
40 v.getMaxX(), v.getMaxY(), v.getMaxZ()),
46 private IntProcedure finder = new IntProcedure() {
47 public boolean execute(int id) {
48 found = idToV.get(id);
53 public V nearest(Point p) {
54 rtree.nearest(new com.infomatiq.jsi.Point(p.x, p.y, p.z), finder, Float.POSITIVE_INFINITY);
60 Visitor<V> visitor = null;
61 private IntProcedure searcher = new IntProcedure() {
62 public boolean execute(int id) {
68 public void range(HasBoundingBox v, Visitor vis) {
70 rtree.intersects(new com.infomatiq.jsi.Rectangle(v.getMinX(), v.getMinY(), v.getMinZ(),
71 v.getMaxX(), v.getMaxY(), v.getMaxZ()),