Optimal Planar Orthogonal Skyline Counting Queries

DOI10.1007/978-3-319-08404-6_10zbMath1416.68056arXiv1304.7959OpenAlexW2149633807MaRDI QIDQ3188886

Gerth Stølting Brodal, Kasper Green Larsen

Publication date: 2 September 2014

Published in: Algorithm Theory – SWAT 2014 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.7959

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (3)

I/O-efficient 2-d orthogonal range skyline and attrition priority queues ⋮ Fast construction of wavelet trees ⋮ Two-dimensional range successor in optimal time and almost linear space

This page was built for publication: Optimal Planar Orthogonal Skyline Counting Queries