Hinrichs; Nievergelt; Schorn (2-dimensional space, l m (or l infty) norm Closest Pair Problem)

From Algorithm Wiki

Revision as of 10:37, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n logn)$ == Space Complexity == $O(n)$ words (https://www.sciencedirect.com/science/article/pii/0020019088901500) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1988 == Reference == https://www.sciencedirect.com/science/article/pii/0020019088901500")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n logn)$

Space Complexity

$O(n)$ words

(https://www.sciencedirect.com/science/article/pii/0020019088901500)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM

Year

1988

Reference

https://www.sciencedirect.com/science/article/pii/0020019088901500

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Hinrichs;_Nievergelt;_Schorn_(2-dimensional_space,_l_m_(or_l_infty)_norm_Closest_Pair_Problem)&oldid=44607"