Approximating the k-Level in Three-Dimensional Plane Arrangements
From MaRDI portal
Publication:4575664
DOI10.1137/1.9781611974331.ch83zbMath1411.68170OpenAlexW2951005712MaRDI QIDQ4575664
Haim Kaplan, Sariel Har-Peled, Micha Sharir
Publication date: 16 July 2018
Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611974331.ch83
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Randomized algorithms (68W20) Combinatorial complexity of geometric structures (52C45)
Related Items (1)
This page was built for publication: Approximating the k-Level in Three-Dimensional Plane Arrangements
