Summary:
Detail:
KdTree()
boolean
contains(Point2D target)
void
draw()
insert(Point2D p)
isEmpty()
static void
main(String[] args)
Point2D
nearest(Point2D target)
Iterable<Point2D>
range(RectHV target)
toGraphviz()
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait