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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Review

2018

Review

2018

Computational geometry is concerned with the design and analysis of algorithms that solve problems on geometric data in R, where…

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…

2016

In the previous lecture, we covered an approximation algorithm that answers a (1+ e)-approximate nearest neighbor query in…

2014

Variations of k-d trees represent a fundamental data structure used in Computational Geometry with numerous applications in…

2012

A spanner graph on a set of points in R d provides shortest paths between any pair of points with lengths at most a constant…

2009

A spanner graph on a set of points in ℝd provides shortest paths between any pair of points with lengths at most a constant…

2006

We present an external-memory algorithm to compute a well-separated pair decomposition (WSPD) of a given point set S in ℝd in O…

2005

2003

Given the positions of n sites in a radio network we consider the problem of finding routes between any pair of sites that…

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…