package edu.berkeley.qfat.geom;
-import edu.wlu.cs.levy.CG.KDTree;
import java.util.*;
public class PointSet<V extends HasPoint> implements Iterable<V> {
- private /*final*/ KDTree kd = new KDTree(3);
- private final double[] doubles = new double[3];
+ private RTree<V> rtree = new RTree<V>();
- public int size() { return exact.size(); }
private HashMap<Point,V> exact = new HashMap<Point,V>();
+ public int size() { return exact.size(); }
+
public Iterator<V> iterator() {
return exact.values().iterator();
}
public void clear() {
- kd = new KDTree(3);
exact = new HashMap<Point,V>();
+ rtree = new RTree<V>();
}
public V get(Point p) {
}
public void rebuild() {
- HashMap<Point,V> old_exact = exact;
- exact = new HashMap<Point,V>();
- kd = new KDTree(3);
- for(V v : old_exact.values()) add(v);
}
public void add(V v) {
if (x != null && x.equals(v)) return;
if (x != null) throw new Error("duplicates!");
Point p = v.getPoint();
- doubles[0] = p.x;
- doubles[1] = p.y;
- doubles[2] = p.z;
- try {
- kd.insert(doubles, v);
- } catch (Exception e) {
- throw new Error(e);
- }
+ rtree.insert(v);
exact.put(p, v);
}
- public void remove(HasPoint v) { remove(v.getPoint()); }
- public void remove(Point p) {
- doubles[0] = p.x;
- doubles[1] = p.y;
- doubles[2] = p.z;
- try {
- kd.delete(doubles);
- } catch (Exception e) { }
+ public void remove(V v) {
+ Point p = v.getPoint();
+ rtree.remove(v);
exact.remove(p);
}
public V nearest(Point p) {
if (exact.size()==0) return null;
- Object[] results;
- try {
- doubles[0] = p.x;
- doubles[1] = p.y;
- doubles[2] = p.z;
- results = kd.nearest(doubles,1);
- } catch (Exception e) {
- throw new Error(e);
- }
- return (V)results[0];
+ return rtree.nearest(p);
}
-
public Vec diagonal() {
float min_x = Float.MAX_VALUE;
float min_y = Float.MAX_VALUE;