An application of $m$-ary trees to the design of data structures for geometric searching problems

DOI10.1051/ita/1989230201651zbMath0681.68083OpenAlexW172147963MaRDI QIDQ4730791

Maurizio Talamo, Giorgio Gambosi

Publication date: 1989

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92329

zbMATH Keywords

data structurescomputational geometryECDF searching problem

Mathematics Subject Classification ID

Searching and sorting (68P10) Computing methodologies and applications (68U99) Data structures (68P05)

Related Items

Staircase tilings and \(k\)-Catalan structures

Cites Work

• Unnamed Item
• Multidimensional divide-and-conquer
• Linear space data structures for two types of range search
• The design of dynamic data structures
• Efficient worst-case data structures for range searching
• Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees
• Decomposable searching problems
• Quad trees: A data structure for retrieval by composite keys
• A data structure for dynamic range queries
• New Data Structures for Orthogonal Range Queries
• Adding range restriction capability to dynamic data structures
• A unifying look at data structures
• Quintary trees
• Lower Bounds on the Complexity of Some Optimal Data Structures
• Decomposable searching problems I. Static-to-dynamic transformation
• A Lower Bound on the Complexity of Orthogonal Range Queries
• Multidimensional binary search trees used for associative searching
• Multidimensional Binary Search Trees in Database Applications