10 likes | 120 Views
Konstantinos Tsakalidis Aarhus University. y 1. Dynamic Orthogonal Planar 3-sided Range Reporting. Smooth. x 2. x 1. Zipfian. y. x. All time bounds are expected . Red are high probability bounds and bold bounds are expected amortized bounds. A priority search tree [M85].
E N D
Konstantinos Tsakalidis Aarhus University y1 DynamicOrthogonal Planar 3-sided Range Reporting Smooth x2 x1 Zipfian y x All time boundsareexpected. Redarehighprobabilitybounds and boldboundsareexpectedamortizedbounds. A priority search tree [M85] MADALGO – Center for Massive Data Algorithmics, a Center of the Danish National Research Foundation