k-nearest neighbor search

Objective. The purpose of this assignment1 is to create a symbol table data type whose
keys are two-dimensional points. We’ll use a 2d-tree to support ecient range search (nd
all the points contained in a query rectangle) and k-nearest neighbor search (nd k points
that are closest to a query point). 2d-trees have numerous applications, ranging from
classifying astronomical objects to computer animation to speeding up neural networks
to mining data to image retrieval.
Geometric Primitives. Use the immutable data type Point2D for points in the plane.
Here is the subset of its API that you may use:
p u b l i c c l a s s

Leave a Reply

Your email address will not be published. Required fields are marked *