package edu.berkeley.qfat.geom;
import edu.wlu.cs.levy.CG.KDTree;
+import java.util.*;
public class PointSet<V extends HasPoint> {
private /*final*/ KDTree kd = new KDTree(3);
private final double[] doubles = new double[3];
+ private HashMap<Point,V> exact = new HashMap<Point,V>();
+
public void clear() {
kd = new KDTree(3);
}
} catch (Exception e) {
throw new Error(e);
}
+ exact.put(p, v);
}
public void remove(HasPoint v) { remove(v.getPoint()); }
try {
kd.delete(doubles);
} catch (Exception e) { }
+ exact.remove(p);
}
public V nearest(Point p) {