Approximating the k-level in three-dimensional plane arrangements

DOI10.1137/1.9781611974331.CH83MaRDI QIDQ4575664zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Randomized algorithms (68W20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial complexity of geometric structures (52C45)

Recommendations

• Approximating the k-Level in Three-Dimensional Plane Arrangements
• CUTTINGS AND APPLICATIONS
• Approximate Levels in Line Arrangements
• On levels in arrangements of lines, segments, planes, and triangles
• On levels in arrangements of surfaces in three dimensions

Cited in

(8)

• CUTTINGS AND APPLICATIONS
• On the complexity of the \(k\)-level in arrangements of pseudoplanes
• scientific article; zbMATH DE number 7651184 (Why is no real title available?)
• Approximate Levels in Line Arrangements
• Linear expected complexity for directional and multiplicative Voronoi diagrams
• Approximating the k-Level in Three-Dimensional Plane Arrangements
• Random Sampling, Halfspace Range Reporting, and Construction of \lowercase$(\le k)$-Levels in Three Dimensions
• scientific article; zbMATH DE number 7559262 (Why is no real title available?)

This page was built for publication: Approximating the \(k\)-level in three-dimensional plane arrangements

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