The following pages link to Squarish <i>k</i>-<i>d</i> Trees (Q2706131):
Displayed 9 items.
- On the cost of fixed partial match queries in \(K\)-d trees (Q308949) (← links)
- Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees (Q906406) (← links)
- Weighted height of random trees (Q934911) (← links)
- Expected time analysis for Delaunay point location (Q1882851) (← links)
- A limit field for orthogonal range searches in two-dimensional random point search trees (Q2274287) (← links)
- Selection by rank in<i>K</i>-dimensional binary search trees (Q2877767) (← links)
- SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS (Q3521595) (← links)
- On the expected cost of partial match queries in random quad-\(K\)-d trees (Q6130360) (← links)
- Median and hybrid median \(K\)-dimensional trees (Q6163962) (← links)