There are no reviews yet. Be the first to send feedback to the community and the maintainers!
Repository Details
From Sedgewick and Wayne Algorithms course. Solving 2D range search problem and nearest-neighbor search problem efficiently. 2D Range Search: given a set of coordinate points in the unit square (x(0.0, 1.0), y(0.0, 1.0)), find the points which are contained in a given axis-aligned rectangle. Nearest-Neighbor Search: Given a set of coordinate points in the unit square, find the point that is closest to a given 'search point'.
