Optimal deterministic shallow cuttings for 3D dominance ranges

DOI10.1137/1.9781611973402.102zbMATH Open1422.68232OpenAlexW4234685832MaRDI QIDQ5384064FDOQ5384064

Authors Peyman Afshani, Konstantinos Tsakalidis

Publication date 20 June 2019

Published in Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611973402.102

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Optimal deterministic shallow cuttings for 3-d dominance ranges
• Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings
• Optimal deterministic algorithms for 2-d and 3-d shallow cuttings
• Range searching with efficient hierarchical cuttings
• Optimal halfspace range reporting in three dimensions

Cited in

(5)

• Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings
• An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ³
• Optimal deterministic algorithms for 2-d and 3-d shallow cuttings
• Approximating the k-Level in Three-Dimensional Plane Arrangements
• Optimal deterministic shallow cuttings for 3-d dominance ranges

This page was built for publication: Optimal deterministic shallow cuttings for 3D dominance ranges

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5384064)