Closest pair of points problem
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.
Area (graph drawing)Closest pairClosest pair of pointsClosest pair problemClosest pairs problemComputational geometryDavid MountDivide-and-conquer algorithmEuclidean minimum spanning treeGreedy geometric spannerHash functionK-nearest neighbors algorithmKinetic closest pairList of algorithmsList of combinatorial computational geometry topicsMinimum distanceNearest-neighbor chain algorithmNearest neighbor searchPenny graphPoint-set triangulationProximity problemsRandomized algorithmRotating calipersStraight skeletonVoronoi diagramWell-separated pair decomposition
Link from a Wikipage to another Wikipage
primaryTopic
Closest pair of points problem
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.
has abstract
En geometría computacional, el ...... solucionado en tiempo O(n).
@es
En géométrie algorithmique, la ...... de la géométrie algorithmique.
@fr
O problema do par de pontos ma ...... e ser resolvido em tempo O(n).
@pt
The closest pair of points pro ...... em can be solved in O(n) time.
@en
Задача о паре ближайших точек ...... жет быть решена за время O(n).
@ru
Задача пошуку найближчої пари ...... ма може бути вирішена за часу.
@uk
مسألة أقرب زوج من النقاط (بالإ ...... قف يصبح حل المسألة في وقت (O(n
@ar
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,023,294,448
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
type
comment
En geometría computacional, el ...... l de algoritmos geométricos.
@es
En géométrie algorithmique, la ...... de la géométrie algorithmique.
@fr
O problema do par de pontos ma ...... nal de algoritmos geométricos.
@pt
The closest pair of points pro ...... exity of geometric algorithms.
@en
Задача о паре ближайших точек ...... сти геометрических алгоритмов.
@ru
Задача пошуку найближчої пари ...... ності геометричних алгоритмів.
@uk
مسألة أقرب زوج من النقاط (بالإ ...... قف يصبح حل المسألة في وقت (O(n
@ar
label
Closest pair of points problem
@en
Dichtestes Punktpaar
@de
Problema del par de puntos más cercanos
@es
Problema do par de pontos mais próximo
@pt
Recherche des deux points les plus rapprochés
@fr
Задача о паре ближайших точек
@ru
Найближча пара точок
@uk
مسألة أقرب زوج من النقاط
@ar
최근접 점쌍 문제
@ko