Reporting and counting maximal points in a query orthogonal rectangle ?
In this work we show that given a set S of n  points with coordinates on an nn n  n grid, we can construct data structures for (i) reporting and (ii) counting the maximal points in an axes-parallel query rectangle in sub-logarithmic time. We assume our model of computation to be the word RAM with size of each word being log?n log ? n bits.
maximal points computational geometry range queries