No label defined (Q3685208)
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 3907781
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3907781 |
Statements
1985
0 references
searching
0 references
nearest neighbor query algorithm
0 references
semidynamic algorithm
0 references
0.830752968788147
0 references
0.8234911561012268
0 references
0.8202184438705444
0 references
[For the entire collection see Zbl 0561.00020.] Given n keys taken from \(\{\) 1,...,m\(\}\) \(\times \{1,...,m\}\), this paper presents an O(log log m) time nearest neighbor query algorithm using O(n) space. An O(log m) time, O(n log m) space semidynamic algorithm and an \(O(\log^{3/2}m)\) time, O(n log m) space dynamic algorithm are also given. All the results apply under \(L_ 1\) and \(L_{\infty}\) metrics.
0 references