Orthogonal range reporting

DOI10.1145/1810959.1811001zbMath1284.68572OpenAlexW2158081121MaRDI QIDQ5405888

Lars Arge, Kasper Dalgaard Larsen, Peyman Afshani

Publication date: 3 April 2014

Published in: Proceedings of the twenty-sixth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1810959.1811001

zbMATH Keywords

data structureslower boundspointer machineorthogonal range reporting

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)

Related Items (8)

An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ³ ⋮ Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions ⋮ Unnamed Item ⋮ Near-linear approximation algorithms for geometric hitting sets ⋮ Optimal deterministic shallow cuttings for 3-d dominance ranges ⋮ Finding pairwise intersections inside a query range ⋮ Permuting and Batched Geometric Lower Bounds in the I/O Model ⋮ Succinct and Implicit Data Structures for Computational Geometry

This page was built for publication: Orthogonal range reporting