On Finding Skyline Points for Range Queries in Plane.
Anil Kishore Kalavagattu, Ananda Swarup Das, Kishore Kothapalli, Kannan Srinathan · Canadian Conference on Computational Geometry · 2011
We consider the dominating point set reporting problem in two-dimension. We propose a data structure for nding the set of dominating points inside a given orthogonal query rectangle. Given a set of n points in the plane, it supports 4-sided queries in O(logn +k), where k is size of the output, usingO(n logn) space. This work can be of application when range queries are generated using mobile devices with limited display capacity.