Dominance range-query: the one-reporting case

Authors:
Thomas Dubé
Affiliations:
-
Venue:
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Year:
1993

Citing 11
Cited 0

Data structures and algorithms 3: multi-dimensional searching and computational geometry

Data structures and algorithms 3: multi-dimensional searching and computational geometry
New data structures for orthogonal range queries

SIAM Journal on Computing
Adding range restriction capability to dynamic data structures

Journal of the ACM (JACM)
Computational geometry: an introduction

Computational geometry: an introduction
History and basic features of the critical-pair/completion procedure

Journal of Symbolic Computation
Lower bounds for orthogonal range searching: I. The reporting case

Journal of the ACM (JACM)
Lower bounds for orthogonal range searching: part II. The arithmetic model

Journal of the ACM (JACM)
A Lower Bound on the Complexity of Orthogonal Range Queries

Journal of the ACM (JACM)
Multidimensional divide-and-conquer

Communications of the ACM
Multidimensional binary search trees used for associative searching

Communications of the ACM
Design of Dynamic Data Structures

Design of Dynamic Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

Problems which arise naturally in computer algebra can be considered as geometric dominance queries in which we are required to identify only one point (if any) which lies within the query range. In this paper, we consider the differences between this problem and other more traditional range query problems. In particular we investigate the inherent complexity of this problem and data structures which can be used for answering this query.