Improved Bounds for Orthogonal Point Enclosure Query and Point Location in Orthogonal Subdivisions in ℝ3
From MaRDI portal
Publication:5362977
DOI10.1137/1.9781611973730.15zbMath1371.68299OpenAlexW4236116507MaRDI QIDQ5362977
Publication date: 5 October 2017
Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611973730.15
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items
I/O-optimal categorical 3-sided skyline queries, An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ3, Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions, Unnamed Item, Finding pairwise intersections inside a query range, Unnamed Item