exact.remove(p);
}
- public V nearest(Point p) {
+ public V nearest(Point p) { return nearest(p, null); }
+ public V nearest(Point p, Visitor<V> vis) {
if (exact.size()==0) return null;
- return rtree.nearest(p);
+ return rtree.nearest(p, vis);
}
// FEATURE: compute incrementally?