Skip to search formSkip to main contentSkip to account menu
Multidimensional binary search trees used for associative searching
TLDR
The multidimensional binary search tree (or <italic>k-d tree) as a data structure for storage of information to be retrieved by associative searches is developed and it is shown to be quite efficient in its storage requirements.
View on ACM
An Algorithm for Finding Best Matches in Logarithmic Expected Time
An algorithm and data structure are presented for searching a file containing N records, each described by k real valued keys, for the m closest matches or nearest neighbors to a given query record.…
View on ACM
Quad trees a data structure for retrieval on composite keys
TLDR
An optimized tree is defined and an algorithm to accomplish optimization in n log n time is presented, guaranteeing that Searching is guaranteed to be fast in optimized trees.
View on Springer
Algorithms for Reporting and Counting Geometric Intersections
TLDR
Algorithms that count the number of pairwise intersections among a set of N objects in the plane and algorithms that report all such intersections are given.
View on IEEE
Scaling and related techniques for geometry problems
TLDR
Three techniques in computational geometry are explored: scaling solves a problem by viewing it at increasing levels of numerical precision; activation is a restricted type of update operation, useful in sweep algorithms; the Cartesian tree is a data structure for problems involving maximums and minimums.
View on ACM
Multidimensional divide-and-conquer
TLDR
Multidimensional divide-and-conquer is discussed, an algorithmic paradigm that can be instantiated in many different ways to yield a number of algorithms and data structures for multidimensional problems.
View on ACM
Fast algorithms for sorting and searching strings
TLDR
This work presents theoretical algorithms for sorting and searching multikey data, and derive from them practical C implementations for applications in which keys are character strings, and presents extensions to more complex string problems, such as partial-match searching.
View on ACM
K-d trees for semidynamic point sets
TLDR
Other new techniques can be applied to general K-d trees, leading to a data structure that is significantly faster and less vulnerable to pathological inputs than ordinary <italic>K—d trees.
View on ACM
Decomposable Searching Problems
  • J. Bentley
  • Computer Science
    Inf. Process. Lett.
  • 11 June 1979
View via Publisher
A locally adaptive data compression scheme
TLDR
A data compression scheme that exploits locality of reference, such as occurs when words are used frequently over short intervals and then fall into long periods of disuse, is described and proves that it never performs much worse than Huffman coding and can perform substantially better.
View on ACM
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License