DATA STRUCTURES FOR RANGE-AGGREGATION OVER CATEGORIES
From MaRDI portal
Publication:2909107
DOI10.1142/S0129054111008982zbMath1255.68060MaRDI QIDQ2909107
Saladi Rahul, Prosenjit Gupta, K. S. Rajan
Publication date: 29 August 2012
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
geometric searching; colored or generalized intersection aggregate problems; output-sensitive querying
68P10: Searching and sorting
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68P05: Data structures
Cites Work
- A technique for adding range restrictions to generalized searching problems
- Fractional cascading. I: A data structuring technique
- Making data structures persistent
- Algorithms for generalized halfspace range searching and other intersection searching problems
- Priority Search Trees
- Filtering Search: A New Approach to Query-Answering
- On the Average Number of Maxima in a Set of Vectors and Applications
- Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
- GENERALIZED INTERSECTION SEARCHING PROBLEMS