Pages that link to "Item:Q3685220"
From MaRDI portal
The following pages link to An $O(E\log E + I)$ Expected Time Algorithm for the Planar Segment Intersection Problem (Q3685220):
Displaying 5 items.
- Scanline algorithms on a grid (Q1111020) (← links)
- A bucketing algorithm for the orthogonal segment intersection search problem and its practical efficiency (Q1115624) (← links)
- On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm (Q3978777) (← links)
- An optimal algorithm for intersecting line segments in the plane (Q4302817) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5901266) (← links)