Combinatorics of intervals in the plane. I: Trapezoids
DOI10.1007/S00454-022-00456-YOpenAlexW3027661369MaRDI QIDQ2679604FDOQ2679604
Authors: Daniel Di Benedetto, József Solymosi, Ethan P. White
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
Recommendations
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
- On the Erdős distinct distances problem in the plane
- An optimal algorithm for intersecting line segments in the plane
- Combinatorial geometry and its algorithmic applications. The Alcalá lectures
- On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm
- Planar realizations of nonlinear Davenport-Schinzel sequences by segments
- Binary Space Partitions for Line Segments with a Limited Number of Directions
- Characterizations of orthodiagonal quadrilaterals
Cited In (2)
This page was built for publication: Combinatorics of intervals in the plane. I: Trapezoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2679604)