Approximate Levels in Line Arrangements

DOI10.1137/0220013MaRDI QIDQ3210186zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

approximate levelcomputational geometrydeterministic algorithmline arrangementsrange counting

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

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

Cited in

(6)

• Perfect level sets in many directions
• Cutting hyperplane arrangements
• Approximating the k-level in three-dimensional plane arrangements
• AN OPTIMAL ALGORITHM FOR COMPUTING (≤K)-LEVELS, WITH APPLICATIONS
• Robust shape fitting via peeling and grating coresets
• 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)