Dominance range-query: the one-reporting case
Thomas W. Dubé · 1993
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.