Approximate Levels in Line Arrangements

DOI10.1137/0220013zbMath0722.68067OpenAlexW2038947487MaRDI QIDQ3210186

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

computational geometryline arrangementsdeterministic algorithmrange countingapproximate level

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (2)

Cutting hyperplane arrangements ⋮ Robust shape fitting via peeling and grating coresets

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