The following pages link to Divided \(k-d\) trees (Q1180539):
Displaying 10 items.
- Efficient dynamic range searching using data replication (Q293421) (← links)
- Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees (Q906406) (← links)
- Orthogonal range searching in linear and almost-linear space (Q1005331) (← links)
- Concatenable structures for decomposable problems (Q1322468) (← links)
- A deterministic skip list for \(k\)-dimensional range search (Q1772103) (← links)
- Efficient splitting and merging algorithms for order decomposable problems. (Q1854311) (← links)
- Space efficient dynamic orthogonal range reporting (Q2461544) (← links)
- Kinetic KD-trees and longest-side KD-trees (Q3602894) (← links)
- A LINEAR SPACE DATA STRUCTURE FOR ORTHOGONAL RANGE REPORTING AND EMPTINESS QUERIES (Q3628098) (← links)
- Efficient splitting and merging algorithms for order decomposable problems (Q4571990) (← links)
