Elsevier

Information Processing Letters

Volume 40, Issue 4, 25 November 1991, Pages 175-179
Information Processing Letters

Satisfying general proximity / similarity queries with metric trees

https://doi.org/10.1016/0020-0190(91)90074-RGet rights and content

Abstract

Divide-and-conquer search strategies are described for satisfying proximity queries involving arbitrary distance metrics.

References (9)

  • D. Golenko-Ginzburg

    Metrics in the permutation space

    Appl. Math. Lett.

    (1991)
  • J. Bentley

    Multidimensional binary search trees for associative searching

    Comm. ACM

    (1975)
  • H. Edelsbrunner

    Algorithms in Combinatorial Geometry

    (1987)
  • K. Mehlhorn

    Multidimensional Searching and Computational Geometry

There are more references available in the full text version of this article.

Cited by (0)

View full text