2-dimensional space, Euclidean metric

Given nn points in 2-dimensional space equipped with the Eucildean metric, find a pair of points with the smallest distance between them.

Parameters

  • nn: number of points
  • kk: dimension of space

Related Problems

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Displaying 2 of 2 algorithms

See more
Khuller; Matias1995O(n)O(n)O(n)O(n), not sure if this is auxiliary
Shamos; Hoey1975O(nlog⁡n)O(n \log n)O(n)O(n)

Reductions Table

Insuffient Data to display table

Other relevant algorithms

Insuffient Data to display table