Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions (Q5864671)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Nearly Optimal Planar k Nearest Neighbors Queries under General Distance Functions |
scientific article; zbMATH DE number 7538276
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions |
scientific article; zbMATH DE number 7538276 |
Statements
Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions (English)
0 references
8 June 2022
0 references
computational geometry
0 references
\(k\) nearest neighbors searching
0 references
range searching
0 references
general distance functions
0 references
randomized data structures
0 references
randomized algorithms
0 references
shallow cuttings
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9739556312561036
0 references
0.8730571866035461
0 references
0.8693950176239014
0 references
0.8112930059432983
0 references
