TY - RPRT
T1 - An O(n)-Space O(log n/log log n + f)-Query Time Algorithm for 3-D Dominance Reporting
Y1 - 2003
A1 - Shi,Qingmin
A1 - JaJa, Joseph F.
KW - Technical Report
AB - We present a linear-space algorithm for handling the {\emthree-dimensional dominance reporting problem}: given a set $S$ of $n$ three-dimensional points, design a data structure for $S$ so that the points in $S$ which dominate a given query point can be reported quickly. Under the variation of the RAM model introduced by Fredman and Willard~\cite{Fredman94}, our algorithm achieves $O(\log n/\log\log n+f)$ query time, where $f$ is the number of points reported. Extensions to higher dimensions are also reported. (UMIACS-TR-2003-77)
PB - Instititue for Advanced Computer Studies, Univ of Maryland, College Park
VL - UMIACS-TR-2003-77
UR - http://drum.lib.umd.edu/handle/1903/1301
ER -