Approximate Levels in Line Arrangements
From MaRDI portal
Publication:3210186
DOI10.1137/0220013zbMath0722.68067MaRDI QIDQ3210186
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
computational geometry; line arrangements; deterministic algorithm; range counting; approximate level
68Q25: Analysis of algorithms and problem complexity
Related Items