Closest pair of points problem

Known as: Closest pairs problem, Closest pair of points, Closest pair 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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1966-2018
05101519662018

Related topics

Related topics

19 relations
Analysis of algorithmsBrute-force searchComputational geometryData structure
(More)

Related mentions per year

Related mentions per year

1937-2019
19401960198020002020
Closest pair of points problem
Randomized algorithm
Recursion
Data structure
Analysis of algorithms
K-nearest neighbors algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Closest Pair and the Post Office Problem for Stochastic Points
Given a (master) set M of n points in d-dimensional Euclidean space, consider drawing a random subset that includes each point mi… (More)
  • figure 1
  • figure 2
Is this relevant?
2006
2006
An Improved Algorithm for Finding the Closest Pair of Points
As early as in 1975, Shamos and Hoey first gave an O(n lg n)-time divide-and-conquer algorithm (SH algorithm in short) for the… (More)
Is this relevant?
2003
2003
On Spatial-Range Closest-Pair Query
An important query for spatial database research is to find the closest pair of objects in a given space. Existing work assumes… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Closest Pair Queries in Spatial Databases
This paper addresses the problem of finding the K closest pairs between two spatial data sets, where each set is stored in a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
1997
Highly Cited
1997
A Reliable Randomized Algorithm for the Closest-Pair Problem
The following two computational problems are studied: Duplicate grouping: Assume that n items are given, each of which is labeled… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Proximity Problems on Moving Points
A kinetic data structure for the maintenance of a multidi mensional range search tree is introduced This structure is used as a… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1993
1993
Randomized Data Structures for the Dynamic Closest-Pair Problem
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data… (More)
  • table V
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Diameter, Width, Closest Line Pair, and Parametric Searching
We apply Megiddo's parametric searching technique to several geometric optimization problems and derive significantly improve… (More)
Is this relevant?
1992
1992
An optimal algorithm for the on-line closest-pair problem
We give an algorithm that computes the closest pair in a set of <italic>n</italic> points in <italic>k</italic>-dimensional space… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs
<italic>We present an algorithm to compute a Euclidean minimum spanning tree of a given set S of n points in</italic… (More)
  • figure 1
  • figure 2
Is this relevant?