A true \(O(n\log{n})\) algorithm for the all-\(k\)-nearest-neighbors problem (Q2180169)
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 7200310
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A true \(O(n\log{n})\) algorithm for the all-\(k\)-nearest-neighbors problem |
scientific article; zbMATH DE number 7200310 |
Statements
A true \(O(n\log{n})\) algorithm for the all-\(k\)-nearest-neighbors problem (English)
0 references
13 May 2020
0 references
computational geometry
0 references
nearest neighbor problems
0 references
all-\(k\)-nearest-neighbors
0 references
0.7976593375205994
0 references
0.7487381100654602
0 references
0.7294159531593323
0 references
