Combinatorics of intervals in the plane. I: Trapezoids
From MaRDI portal
Publication:2679604
Recommendations
Cites work
- An optimal algorithm for intersecting line segments in the plane
- Binary Space Partitions for Line Segments with a Limited Number of Directions
- Characterizations of orthodiagonal quadrilaterals
- Combinatorial geometry and its algorithmic applications. The Alcalá lectures
- On the Erdős distinct distances problem in the plane
- 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
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)