Up: Directory of Computational Geometry Software

Nearest neighbors


A collection of space decompositions which can be used to find the k nearest neighbors of a query point or for orthogonal range queries (report the points contained in a box). Also contains some generators for difficult data distributions, projections of point sets, and visualizations of the data structures.

By Michael Murphy, under the direction of Steve Skiena, at SUNY Stony Brook.

More info and links to the code reside on the Web page.

Note that in low dimensions (up to about eight?), you might want to use a convex hull program to compute a Voronoi diagram; the cells of a Voronoi diagram are the regions of space closest to one of the given points.

Up: Directory of Computational Geometry Software

[HOME] The Geometry Center Home Page

Comments to: nina@geom.umn.edu
Created: May 31 1995 --- Last modified: Thu Jun 1 14:25:13 1995