Pages that link to "Item:Q1092665"
From MaRDI portal
The following pages link to The efficiency of using k-d trees for finding nearest neighbors in discrete space (Q1092665):
Displaying 7 items.
- Refinements to nearest-neighbor searching in k-dimensional trees (Q802864) (← links)
- Finding nearest neighbors with Voronoi tessellations (Q910225) (← links)
- Choosing optimal branching factors for k-d-B trees (Q1058876) (← links)
- Resilient \(k\)-d trees: \(k\)-means in space revisited (Q1762186) (← links)
- (Q3403220) (← links)
- Neighbours on a grid (Q5054822) (← links)
- An Improved Algorithm Finding Nearest Neighbor Using Kd-trees (Q5458545) (← links)