Pages that link to "Item:Q3978777"
From MaRDI portal
The following pages link to On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm (Q3978777):
Displaying 10 items.
- Improved enumeration of simple topological graphs (Q377494) (← links)
- Degrees of nonlinearity in forbidden 0-1 matrix problems (Q409347) (← links)
- On counting pairs of intersecting segments and off-line triangle range searching (Q676268) (← links)
- Planar rectilinear shortest path computation using corridors (Q833714) (← links)
- \(L_ 1\) shortest paths among polygonal obstacles in the plane (Q1188116) (← links)
- On the number of touching pairs in a set of planar curves (Q1693324) (← links)
- Combinatorics of intervals in the plane. I: Trapezoids (Q2679604) (← links)
- Continuous-Time Moving Network Voronoi Diagram (Q3223928) (← links)
- Saturation of Multidimensional 0-1 Matrices (Q5889965) (← links)
- On the number of tangencies among 1-intersecting \(x\)-monotone curves (Q6201909) (← links)
