Maintaining range trees in secondary memory. Part I: Partitions

DOI10.1007/BF00289018zbMath0672.68007OpenAlexW1999166624MaRDI QIDQ1120266

Marc J. van Kreveld, Mark T. de Berg, Michiel H. M. Smid, Mark H. Overmars

Publication date: 1990

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00289018

zbMATH Keywords

computer graphicsdatabasesorthogonal range searching problempartition of range treepartition schemesrange trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (3)

Topology B-trees and their applications ⋮ Maintaining range trees is secondary memory. Part II: Lower bounds ⋮ Maintaining multiple representations of dynamic data structures

Cites Work

• The design of dynamic data structures
• Implementation of the grid file: Design concepts and experience
• On the average number of rebalancing operations in weight-balanced trees
• Decomposable searching problems
• Organization and maintenance of large ordered indexes
• Adding range restriction capability to dynamic data structures
• Binary Search Trees of Bounded Balance
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Maintaining range trees in secondary memory. Part I: Partitions