Combinatorics of intervals in the plane. I: Trapezoids
From MaRDI portal
Publication:2679604
DOI10.1007/s00454-022-00456-yOpenAlexW3027661369MaRDI QIDQ2679604
József Solymosi, Ethan P. White, Daniel Di Benedetto
Publication date: 23 January 2023
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.09003
Erd?s problems and related topics of discrete geometry (52C10) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30) Combinatorial complexity of geometric structures (52C45)
Cites Work
- Unnamed Item
- Unnamed Item
- On the Erdős distinct distances problem in the plane
- Planar realizations of nonlinear Davenport-Schinzel sequences by segments
- On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm
- An optimal algorithm for intersecting line segments in the plane
- Binary Space Partitions for Line Segments with a Limited Number of Directions
This page was built for publication: Combinatorics of intervals in the plane. I: Trapezoids