Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back (Q2415385)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7057365
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back |
scientific article; zbMATH DE number 7057365 |
Statements
Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back (English)
0 references
21 May 2019
0 references
geometric data structures
0 references
range searching
0 references
nearest neighbor searching
0 references
k-d trees
0 references
range trees
0 references
all-pairs shortest paths
0 references
Boolean matrix multiplication
0 references
0 references
0 references
0 references
0.9855949878692628
0 references
0.830779492855072
0 references
0.807258665561676
0 references
0.8037914633750916
0 references
0.8018617033958435
0 references
