A Simple Data Structure For Optimal Two-Sided 2d Orthogonal Range Queries

Given an arbitrary set A of two-dimensional points over a totally-ordered domain, a two-sided planar range query consists on finding all points of A within an arbitrary quadrant. In this paper we present a novel data structure that uses linear space in vertical bar A vertical bar while allowing for two-dimensional orthogonal range queries with logarithmic pre-processing and constant-delay enumeration.