1.6.6 Range Search

Problem Input | Problem Output 


INPUT                    OUTPUT

Input Description: A set S of n points in E^d , and a query polygon Q .

Problem: Which points from S lie within Q ?

Implementations

  • LEDA - A Library of Efficient Data Types and Algorithms (C++) (rating 7)
  • Ranger - Nearest Neighbor Search in Higher Dimensions (C) (rating 6)
  • Algorithms in C++ -- Sedgewick (C++) (rating 4)
  • Handbook of Algorithms and Data Structures (Pascal) (rating 2)

    Related Problems

  • Kd-Trees
  • Nearest Neighbor Search
  • Point Location

    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 .