Approximate Levels in Line Arrangements

DOI10.1137/0220013zbMATH Open0722.68067OpenAlexW2038947487MaRDI QIDQ3210186FDOQ3210186

Authors: Jiří Matoušek 

Publication date: 1991

Published in: SIAM Journal on Computing (Search for Journal in Brave)

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

Recommendations

• Approximating the \(k\)-level in three-dimensional plane arrangements
• Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
• Partitioning arrangements of lines. I: An efficient deterministic algorithm
• On levels in arrangements of lines, segments, planes, and triangles
• Approximating the k-Level in Three-Dimensional Plane Arrangements

zbMATH Keywords

computational geometrydeterministic algorithmline arrangementsrange countingapproximate level

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (5)

• Perfect level sets in many directions
• Cutting hyperplane arrangements
• Robust shape fitting via peeling and grating coresets
• Approximating the \(k\)-level in three-dimensional plane arrangements
• Partitioning arrangements of lines. II: Applications

This page was built for publication: Approximate Levels in Line Arrangements

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