Orthogonal Range Reporting in Three and Higher Dimensions
From MaRDI portal
Publication:5171171
DOI10.1109/FOCS.2009.58zbMath1292.68141OpenAlexW2111410263MaRDI QIDQ5171171
Kasper Dalgaard Larsen, Lars Arge, Peyman Afshani
Publication date: 25 July 2014
Published in: 2009 50th Annual IEEE Symposium on Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/focs.2009.58
Related Items
Finding pairwise intersections of rectangles in a query rectangle ⋮ Range Minimum Query Indexes in Higher Dimensions ⋮ Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions ⋮ Optimal deterministic shallow cuttings for 3-d dominance ranges ⋮ Finding pairwise intersections inside a query range ⋮ Unnamed Item ⋮ Permuting and Batched Geometric Lower Bounds in the I/O Model ⋮ Unnamed Item
