Pages that link to "Item:Q4682170"
From MaRDI portal
The following pages link to RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS (Q4682170):
Displaying 9 items.
- I/O-efficient algorithms for computing planar geometric spanners (Q929749) (← links)
- Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection (Q991174) (← links)
- Efficient searching with linear constraints (Q1591152) (← links)
- I/O-efficient dynamic planar point location (Q1882856) (← links)
- Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions (Q2269835) (← links)
- Permuting and Batched Geometric Lower Bounds in the I/O Model (Q5111685) (← links)
- I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions (Q5387782) (← links)
- I/O-efficient point location using persistent B-trees (Q5463442) (← links)
- External memory planar point location with logarithmic updates (Q5920252) (← links)
