Optimal Deterministic Shallow Cuttings for 3D Dominance Ranges

DOI10.1137/1.9781611973402.102zbMath1422.68232OpenAlexW4234685832MaRDI QIDQ5384064

Konstantinos Tsakalidis, Peyman Afshani

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) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (4)

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

This page was built for publication: Optimal Deterministic Shallow Cuttings for 3D Dominance Ranges