Pages that link to "Item:Q2489539"
From MaRDI portal
The following pages link to Approximate range searching using binary space partitions (Q2489539):
Displaying 11 items.
- Tight lower bounds for halfspace range searching (Q420572) (← links)
- Binary plane partitions for disjoint line segments (Q540437) (← links)
- Approximate range searching in external memory (Q627532) (← links)
- Quasi-optimal range searching in spaces of finite VC-dimension (Q1823698) (← links)
- Computing the visibility map of fat objects (Q2269142) (← links)
- Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions (Q2269835) (← links)
- Fast algorithms for approximate Fréchet matching queries in geometric trees (Q2349741) (← links)
- Approximate Range Searching: The Absolute Model (Q3603509) (← links)
- (Q4410603) (← links)
- Approximate Range Searching in External Memory (Q5387785) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465845) (← links)