New Lower Bounds for the Number of Pseudoline Arrangements

DOI10.1137/1.9781611975482.26zbMath1431.68117arXiv1809.03619OpenAlexW2949194403MaRDI QIDQ5236207

Ritankar Mandal, Adrian Dumitrescu

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1809.03619

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Related Items (3)

Optimal reconfiguration of optimal ladder lotteries ⋮ New algorithms and bounds for halving pseudolines ⋮ Many order types on integer grids of polynomial size

This page was built for publication: New Lower Bounds for the Number of Pseudoline Arrangements