Closest Pair Problem

The closest pair problem is a problem of computational geometry: given $n$ points in metric space, find a pair of points with the smallest distance between them.

KSL

k-dimensional space,

l_m

l_\infty

5 Algorithms

2SL

2-dimensional space,

l_m

l_\infty

1 Algorithms

2-dimensional space, $l_m$ (or $l_\infty$) norm

k-dimensional space, $l_m$ (or $l_\infty$) norm
2SL
2-dimensional space, $l_m$ (or $l_\infty$ ) norm
1 Algorithms
- 2-dimensional space, $l_m$ (or $l_\infty$) norm

ESI

Euclidean space in k dimensions

1 Algorithms

2SE

2-dimensional space, Euclidean metric

4 Algorithms

2AR

2-dimensional array representation

2 Algorithms

2-dimensional array representation

2-dimensional space, Euclidean metric
2AR
2-dimensional array representation
2 Algorithms
- 2-dimensional array representation

Euclidean space in k dimensions
2SE
2-dimensional space, Euclidean metric
4 Algorithms
2AR
2-dimensional array representation
2 Algorithms
2-dimensional array representation
- 2-dimensional space, Euclidean metric
- 2AR
  2-dimensional array representation
  2 Algorithms
  - 2-dimensional array representation