A true \(O(n\log{n})\) algorithm for the all-\(k\)-nearest-neighbors problem (Q2180169)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A true \(O(n\log{n})\) algorithm for the all-\(k\)-nearest-neighbors problem |
scientific article |
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
