The extendible cell method for closest point problems

This publication has 10 references indexed in Scilit:

• Order preserving extendible hashing and bucket tries
  BIT Numerical Mathematics, 1981
• The K-D-B-tree
  Published by Association for Computing Machinery (ACM) ,1981
• Optimal Expected-Time Algorithms for Closest Point Problems
  ACM Transactions on Mathematical Software, 1980
• Data Structures for Range Searching
  ACM Computing Surveys, 1979
• Transforming static data structures to dynamic structures
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1979
• Extendible hashing—a fast access method for dynamic files
  ACM Transactions on Database Systems, 1979
• Geographic Data Processing
  ACM Computing Surveys, 1979
• An Algorithm for Finding Best Matches in Logarithmic Expected Time
  ACM Transactions on Mathematical Software, 1977
• Analysis of range searches in quad trees
  Information Processing Letters, 1975
• The Statistical Analysis of Series of Events
  Published by Springer Nature ,1966