Optimal Planar Orthogonal Skyline Counting Queries

@inproceedings{Brodal2014OptimalPO,
  title={Optimal Planar Orthogonal Skyline Counting Queries},
  author={Gerth St\olting Brodal and Kasper Green Larsen},
  booktitle={SWAT},
  year={2014}
}
The skyline of a set of points in the plane is the subset of maximal points, where a point (x, y) is maximal if no other point (x′, y′) satisfies x′ ≥ x and y′ ≥ x. We consider the problem of preprocessing a set P of n points into a space efficient static data structure supporting orthogonal skyline counting queries, i.e. given a query rectangle R to report the size of the skyline of P ∩ R. We present a data structure for storing n points with integer coordinates having query time O(lg n/ lg lg… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS
4 Citations
20 References
Similar Papers

Similar Papers

Loading similar papers…