Closest pair of points problem
id:
closest-pair-of-points-problem-198-10508690
title:
Closest pair of points problem
text:
The closest pair of points problem or 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. The closest pair problem for points in the Euclidean plane was among the first geometric problems that were treated at the origins of the systematic study of the computational complexity of geometric algorithms.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Closest_pair_of_points_problem
date created:
date modified:
2023-08-13T13:48:45Z
main entity:
{"identifier":"Q1209543","url":"https://www.wikidata.org/entity/Q1209543"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/3/37/Closest_pair_of_points.svg","width":256,"height":256}
fields total:
13
integrity:
14