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

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Given a real number $t>1$, a geometric $t$-spanner is a geometric graph for a point set in $\mathbb{R}^d$ with straight lines… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2016
2016
  • Rolf Klein
  • Encyclopedia of Algorithms
  • 2016
  • Corpus ID: 28799006
 
Is this relevant?
2015
2015
Instant radiosity methods rely on using a large number of virtual point lights VPLs to approximate global illumination… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2014
2014
Variations of k-d trees represent a fundamental data structure used in Computational Geometry with numerous applications in… Expand
  • figure 1
  • table 1
Is this relevant?
2013
2013
The well-separated pair decomposition (WSPD) is a fundamental structure in computational geometry. Given a set P of n points in d… Expand
  • figure 2
  • figure 3
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
2010
2010
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
Is this relevant?
2008
2008
Given a point set in a fixed dimension, we note that a well-separated pair decomposition can be found in linear time if we assume… Expand
Is this relevant?
2000
2000
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
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1995
1995
Many problems of great practical importance and theoretical interest can be posed as computations on finite point sets in fixed… Expand
Is this relevant?
1993
1993
  • Paul B. 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
  • figure 3
  • figure 2
  • figure 1
  • figure 5
Is this relevant?