Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.
Well-separated pair decomposition
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
Is this relevant?
2016
2015
2015
Instant radiosity methods rely on using a large number of virtual point lights VPLs to approximate global illumination… Expand
Is this relevant?
2014
2014
A well-separated pairs decomposition algorithm for k-d trees implemented on multi-core architectures
Variations of k-d trees represent a fundamental data structure used in Computational Geometry with numerous applications in… Expand
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
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
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
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
Is this relevant?