Bentley; Shamos (k-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(kn logn)$ == Space Complexity == $O(kn)$? words (keep track of all sorted lists in each dimension; re-use space from recursive calls) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1976 == Reference == https://dl.acm.org/citation.cfm?id=803652")

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

Jump to navigation Jump to search

Time Complexity

$O(kn logn)$

Space Complexity

$O(kn)$? words

(keep track of all sorted lists in each dimension; re-use space from recursive calls)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM

Year

1976

Reference

https://dl.acm.org/citation.cfm?id=803652

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Bentley;_Shamos_(k-dimensional_space,_l_m_(or_l_infty)_norm_Closest_Pair_Problem)&oldid=44606"