5 citations · 8 across the 6 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.DS2012
I/O-Efficient Dynamic Planar Range Skyline Queries
Casper Kejlberg-Rasmussen, Konstantinos Tsakalidis, Kostas Tsichlas
We present the first fully dynamic worst case I/O-efficient data structures that support planar orthogonal \textit{3-sided range skyline reporting queries} in $\bigO (\log_{2B^ε} n…
cs.DS2012
Dynamic 3-sided Planar Range Queries with Expected Doubly Logarithmic Time
Gerth Stølting Brodal, Alexis C. Kaporis, Apostolos N. Papadopoulos +3
This work studies the problem of 2-dimensional searching for the 3-sided range query of the form in both main and external memory, by considering a vari…