1.6.5 Nearest Neighbor Search

Problem Input | Problem Output 


INPUT                    OUTPUT

Input Description: A set S of n points in d dimensions; a query point q .

Problem: Which point in S is closest to q ?

Implementations

  • Ranger - Nearest Neighbor Search in Higher Dimensions (C) (rating 7)
  • LEDA - A Library of Efficient Data Types and Algorithms (C++) (rating 6)
  • Joseph O'Rourke's Computational Geometry (C) (rating 5)
  • Moret and Shapiro's Algorithms P to NP (Pascal) (rating 3)

    Related Problems

  • Kd-Trees
  • Point Location
  • Range Search
  • Voronoi Diagrams

    Go to the corresponding chapter in the book
    About the Book
    Send us Mail
    Go to Main Page

    This page last modified on Tue Jun 03, 1997 .