Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

19 relations
Analysis of algorithmsBrute-force searchComputational geometryData structure

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Modified brute force algorithm to solve the closest pair of points problem based on dynamic warping
This paper introduces an algorithm to solve the closest pair of points problem in a 2D plane based on dynamic warping. The… 
2013
2013
A Protocol for Privacy-Preserving Closest-Pair of Points
Secure multi-party computation focuses on how to conduct some cooperative computations among distrusted parties with privacy… 
2010
2010
Algorithms for constrained k-nearest neighbor queries over moving object trajectories
An important query for spatio-temporal databases is to find nearest trajectories of moving objects. Existing work on this topic… 
2010
2010
Two protocols for no-information leaked closest-pair of points
Secure Multi-party Computation(SMC) plays an important role in information security under the circumstance of network cooperation… 
2009
2009
The Closest Pair Problem under the Hamming Metric
Finding the closest pair among a given set of points under Hamming Metric is a fundamental problem with many applications. Let n… 
2008
2008
A Protocol for Privacy-Preserving Closest-Pair of Points
At present,research on privacy-preserving computational geometry is of great interest in the field of secure multi-party… 
2006
2006
Protection or Privacy? Data Mining and Personal Data
In order to run countries and economies effectively, governments and governmental institutions need to collect and analyse vast… 
2005
2005
Range-Aggregate Query Problems Involving Geometric Aggregation Operations
We consider variations of the standard orthogonal range searching motivated by applications in database querying and VLSI layout… 
2004
2004
Image Thresholding by Histogram Segmentation Using Discriminant Analysis
Image segmentation is often used to distinguish the foreground from the background. This paper proposes a novel method of image… 
2002
2002
I/o-efficient algorithms for shortest path related problems
In this thesis, we study I/O-efficient algorithms for problems related to computing shortest paths in outerplanar and planar… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)