2-dimensional space, Euclidean metric: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 34: | Line 34: | ||
[[File:Closest Pair Problem - 2-dimensional space, Euclidean metric - Space.png|1000px]] | [[File:Closest Pair Problem - 2-dimensional space, Euclidean metric - Space.png|1000px]] | ||
== | == Space-Time Tradeoff Improvements == | ||
[[File:Closest Pair Problem - 2-dimensional space, Euclidean metric - Pareto Frontier.png|1000px]] | [[File:Closest Pair Problem - 2-dimensional space, Euclidean metric - Pareto Frontier.png|1000px]] | ||
Revision as of 14:35, 15 February 2023
Description
Given $n$ points in 2-dimensional space equipped with the Eucildean metric, find a pair of points with the smallest distance between them.
Related Problems
Related: k-dimensional space, $l_m$ (or $l_\infty$) norm, 2-dimensional space, $l_m$ (or $l_\infty$) norm, 2-dimensional array representation
Parameters
No parameters found.
Table of Algorithms
| Name | Year | Time | Space | Approximation Factor | Model | Reference |
|---|---|---|---|---|---|---|
| Khuller; Matias Randomized Sieve | 1995 | $O(n)$ | $O(n)$, not sure if this is auxiliary | Exact | Randomized | Time & Space |
| Shamos; Hoey | 1975 | $O(n logn)$ | $O(n)$ | Exact | Deterministic | Time |
Time Complexity Graph
Space Complexity Graph
Space-Time Tradeoff Improvements
