scientific article; zbMATH DE number 3907781

From MaRDI portal
Publication:3685208





[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.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3685208)