Shamos; Hoey (2-dimensional space, Euclidean metric 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 (Voronoi diagrams require O(n) space) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1975 == Reference == https://ieeexplore.ieee.org/document/4567872")
(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

(Voronoi diagrams require O(n) space)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM

Year

1975

Reference

https://ieeexplore.ieee.org/document/4567872

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Shamos;_Hoey_(2-dimensional_space,_Euclidean_metric_Closest_Pair_Problem)&oldid=44608"