Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,319 papers from all fields of science
Search
Sign In
Create Free Account
Closest pair of points problem
Known as:
Closest pairs problem
, Closest pair of points
, Closest pair problem
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
19 relations
Analysis of algorithms
Brute-force search
Computational geometry
Data structure
Expand
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
Rhowel M. Dellosa
,
Arnel C. Fajardo
,
Ruji P. Medina
Indonesian Journal of Electrical Engineering and…
2019
Corpus ID: 209080130
This paper introduces an algorithm to solve the closest pair of points problem in a 2D plane based on dynamic warping. The…
Expand
2013
2013
A Protocol for Privacy-Preserving Closest-Pair of Points
Wang Yan-chun
2013
Corpus ID: 63844415
Secure multi-party computation focuses on how to conduct some cooperative computations among distrusted parties with privacy…
Expand
2010
2010
Algorithms for constrained k-nearest neighbor queries over moving object trajectories
Yunjun Gao
,
Baihua Zheng
,
Gencai Chen
,
Qing Li
GeoInformatica
2010
Corpus ID: 40143122
An important query for spatio-temporal databases is to find nearest trajectories of moving objects. Existing work on this topic…
Expand
2010
2010
Two protocols for no-information leaked closest-pair of points
Sun Yan-fei
2010
Corpus ID: 124073831
Secure Multi-party Computation(SMC) plays an important role in information security under the circumstance of network cooperation…
Expand
2009
2009
The Closest Pair Problem under the Hamming Metric
Kerui Min
,
M. Kao
,
Hong Zhu
International Computing and Combinatorics…
2009
Corpus ID: 31369823
Finding the closest pair among a given set of points under Hamming Metric is a fundamental problem with many applications. Let n…
Expand
2008
2008
A Protocol for Privacy-Preserving Closest-Pair of Points
Li Jiang-hua
2008
Corpus ID: 63425854
At present,research on privacy-preserving computational geometry is of great interest in the field of secure multi-party…
Expand
2006
2006
Protection or Privacy? Data Mining and Personal Data
D. Hand
Pacific-Asia Conference on Knowledge Discovery…
2006
Corpus ID: 2663972
In order to run countries and economies effectively, governments and governmental institutions need to collect and analyse vast…
Expand
2005
2005
Range-Aggregate Query Problems Involving Geometric Aggregation Operations
Prosenjit Gupta
Nordic Journal of Computing
2005
Corpus ID: 28138686
We consider variations of the standard orthogonal range searching motivated by applications in database querying and VLSI layout…
Expand
2004
2004
Image Thresholding by Histogram Segmentation Using Discriminant Analysis
A. Arifin
,
A. Asano
2004
Corpus ID: 446211
Image segmentation is often used to distinguish the foreground from the background. This paper proposes a novel method of image…
Expand
2002
2002
I/o-efficient algorithms for shortest path related problems
A. Maheshwari
,
Jörg-Rüdiger Sack
,
N. Zeh
2002
Corpus ID: 117560459
In this thesis, we study I/O-efficient algorithms for problems related to computing shortest paths in outerplanar and planar…
Expand
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)
ACCEPT & CONTINUE