Shamos; Hoey (2-dimensional space, Euclidean metric Closest Pair Problem)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(n \log n)$

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=46966"