A counter example to a monotonicity property of k-d trees

DOI10.1016/0020-0190(82)90099-0zbMATH Open0533.68066OpenAlexW2015488612MaRDI QIDQ789903FDOQ789903

Authors: Mamoru Hoshi, Toshitsugu Yuba 

Publication date: 1982

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(82)90099-0

Recommendations

• Generalized \(k\)-\(d\)-trees and local reorganizations
• Refinements to nearest-neighbor searching in k-dimensional trees
• Multidimensional balanced binary trees
• scientific article; zbMATH DE number 1670657
• scientific article

zbMATH Keywords

dynamic programming algorithmmonotonicity propertymultidimensional binary search treeoptimum tree

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Cites Work

• Multidimensional binary search trees used for associative searching
• Optimum binary search trees
• Optimum multiway search trees
• The construction of optimal multiway search trees and the monotonicity principle
• Optimal Alphabetic Trees

This page was built for publication: A counter example to a monotonicity property of k-d trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q789903)