Average case analysis of region search in balanced k-d trees

DOI10.1016/0020-0190(79)90110-8zbMath0397.68065OpenAlexW2065583528MaRDI QIDQ1253931

Ysmar V. Silva Filho

Publication date: 1979

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

Full work available at URL: https://doi.org/10.1016/0020-0190(79)90110-8

zbMATH Keywords

Asymptotic BehaviourAnalysis of Region SearchBalanced Trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Information storage and retrieval of data (68P20) Discrete mathematics in relation to computer science (68R99)

Related Items (1)

Evaluation of Range Searching Methods for Contact Searching in Mechanical Engineering

Cites Work

• Analysis of range searches in quad trees
• Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees
• Multidimensional binary search trees used for associative searching
• Unnamed Item
• Unnamed Item

This page was built for publication: Average case analysis of region search in balanced k-d trees