Pages that link to "Item:Q868436"
From MaRDI portal
The following pages link to External-memory algorithms for processing line segments in geographic information systems (Q868436):
Displaying 11 items.
- Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep (Q1384210) (← links)
- Building an optimal point-location structure in \(O(\operatorname{sort}(n))\) I/Os (Q1741853) (← links)
- Lower bounds for intersection searching and fractional cascading in higher dimension (Q1887711) (← links)
- Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions (Q2269835) (← links)
- Cache-Oblivious Red-Blue Line Segment Intersection (Q3541077) (← links)
- RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS (Q4682170) (← links)
- Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep (Q5057447) (← links)
- Dynamic Planar Point Location in External Memory. (Q5088984) (← links)
- Permuting and Batched Geometric Lower Bounds in the I/O Model (Q5111685) (← links)
- External memory planar point location with logarithmic updates (Q5920252) (← links)
- External-memory algorithms for processing line segments in geographic information systems (Q6102308) (← links)
