Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,180,392 papers from all fields of science
Search
Sign In
Create Free Account
Well-separated pair decomposition
In computational geometry, a well-separated pair decomposition (WSPD) of a set of points , is a sequence of pairs of sets , such that each pair is…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Approximation algorithm
Geometric spanner
Minimum bounding box
Nearest neighbor search
Expand
Broader (1)
Computational geometry
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2018
Review
2018
The Well-Separated Pair Decomposition and Its Applications
M. Smid
Handbook of Approximation Algorithms and…
2018
Corpus ID: 3011433
Computational geometry is concerned with the design and analysis of algorithms that solve problems on geometric data in R, where…
Expand
2014
2014
A well-separated pairs decomposition algorithm for k-d trees implemented on multi-core architectures
R. Lopes
,
I. Reid
,
P. Hobson
2014
Corpus ID: 1430448
Variations of k-d trees represent a fundamental data structure used in Computational Geometry with numerous applications in…
Expand
2009
2009
The Emergence of Sparse Spanners and Greedy Well-Separated Pair Decomposition
Jie Gao
,
Dengpan Zhou
Scandinavian Workshop on Algorithm Theory
2009
Corpus ID: 12711531
A spanner graph on a set of points in ℝd provides shortest paths between any pair of points with lengths at most a constant…
Expand
2008
2008
Well Separated Pair Decomposition
Jie Gao
,
Li Zhang
Encyclopedia of Algorithms
2008
Corpus ID: 8316237
In the previous lecture, we covered an approximation algorithm that answers a (1+ e)-approximate nearest neighbor query in…
Expand
2006
2006
I/O-Efficient Well-Separated Pair Decomposition and Applications
Sathish Govindarajan
,
Tamás Lukovszki
,
A. Maheshwari
,
N. Zeh
Algorithmica
2006
Corpus ID: 26222152
We present an external-memory algorithm to compute a well-separated pair decomposition (WSPD) of a given point set S in ℝd in O…
Expand
2003
2003
Well-separated pair decomposition for the unit-disk graph metric and its applications
Jie Gao
,
Li Zhang
Symposium on the Theory of Computing
2003
Corpus ID: 5160
We extend the classic notion of well-separated pair decomposition [10] to the (weighted) unit-disk graph metric: the shortest…
Expand
2000
2000
I/O-Efficient Well-Separated Pair Decomposition and Its Applications
Sathish Govindarajan
,
Tamás Lukovszki
,
A. Maheshwari
,
N. Zeh
Embedded Systems and Applications
2000
Corpus ID: 11333264
We present an external memory algorithm to compute a well-separated pair decomposition (WSPD) of a given point set P in Rd in O…
Expand
Highly Cited
1996
Highly Cited
1996
Probabilistic approximation of metric spaces and its algorithmic applications
Y. Bartal
Proceedings of 37th Conference on Foundations of…
1996
Corpus ID: 2095594
This paper provides a novel technique for the analysis of randomized algorithms for optimization problems on metric spaces, by…
Expand
Highly Cited
1995
Highly Cited
1995
Dealing with higher dimensions: the well-separated pair decomposition and its applications
P. Callahan
1995
Corpus ID: 115623032
Many problems of great practical importance and theoretical interest can be posed as computations on finite point sets in fixed…
Expand
Highly Cited
1993
Highly Cited
1993
Optimal parallel all-nearest-neighbors using the well-separated pair decomposition
P. Callahan
Proceedings of IEEE 34th Annual Foundations of…
1993
Corpus ID: 13968373
We present an optimal parallel algorithm to construct the well-separated pair decomposition of a point set P in R/sup d/. We show…
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