Given points in 2 and 3 dimensions find the k nearest neighbors for each point.
The input needs to be in either the 2d or 3d points file format. The output needs to be in the sequence file format and must contain for each point the integer index of each of its closest k neighbors sorted by distance (nearest first). For n input points, the number of integers in the output is threfore k × n. The neighbors of each point are adjacent and the points must be in the same order as the input.
uniform -d 2 <n> <filename>
plummer -d 2 <n> <filename>
uniform -d 3 <n> <filename>
uniform -S -d 3 <n> <filename>
uniform -d 3 <n> <filename>
plummer -d 3 <n> <filename>
This project has been funded by the following sources:
Intel Labs Academic Research Office for the Parallel Algorithms for Non-Numeric Computing Program,
National Science Foundation, and
IBM Research.