New Results on Intersection Query Problems

Abstract

We present simple algorithms for three problems belonging to the class of intersection query problems. The first algorithm deals with the static rectangle enclosure problem and can easily be extended to d dimensions, the second algorithm copes with the generalized c-oriented polygon intersection searching problem in two dimensions, while the third solves the static 2-dimensional dominance searching problem with respect to a set of obstacles. All algorithms are simple, are based on persistence and improve previous bounds. Also, as a corollary of the first algorithm, we present a result for the static d-dimensional range searching problem.