Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

19 relations
Analysis of algorithmsBrute-force searchComputational geometryData structure
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
Spanners for Geometric Intersection Graphs
A disk graph is an intersection graph of a set of disks with arbitrary radii in the plane. In this paper, we consider the problem… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2001
Highly Cited
2001
C2P: Clustering based on Closest Pairs
In this paper we present C 2 P, a new clustering algorithm for large spatial databases, which exploits spatial access methods for… Expand
  • figure 1
  • figure 2
  • figure 6
  • figure 7
  • figure 8
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… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
A hierarchical method for real-time distance computation among moving convex bodies
Abstract This paper presents the Hierarchical Walk , or H-Walk algorithm, which maintains the distance between two moving convex… Expand
  • 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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
1998
Highly Cited
1998
V-Clip: fast and robust polyhedral collision detection
This article presents the Voronoi-clip, or V-Clip, collision detection alogrithm for polyhedral objects specified by a boundary… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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 thatnitems are given, each of which is labeled by… Expand
Is this relevant?
1997
1997
A practical evaluation of kinetic data structures
In many applications of computational geometry to modeling objects and processes in the physical world, the participating objects… Expand
  • table 1
  • table 2
Is this relevant?
Highly Cited
1980
Highly Cited
1980
Multidimensional divide-and-conquer
Most results in the field of algorithm design are single algorithms that solve single problems. In this paper we discuss… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 7
Is this relevant?
Highly Cited
1966
Highly Cited
1966
A Generalized Sorting Strategy for Computer Classifications
AGGLOMERATIVE hierarchical methods of computer classification all begin by calculating distance-measures between elements. The… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE