The following pages link to (Q4552048):
Displayed 7 items.
- Approximate range searching in external memory (Q627532) (← links)
- Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies (Q988687) (← links)
- Indexing moving points (Q1394801) (← links)
- I/O-efficient dynamic planar point location (Q1882856) (← links)
- Cache-Oblivious Red-Blue Line Segment Intersection (Q3541077) (← links)
- Permuting and Batched Geometric Lower Bounds in the I/O Model (Q5111685) (← links)
- I/O-efficient point location using persistent B-trees (Q5463442) (← links)