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.

2018

In this paper, we present a local routing scheme for the well-separated pair decomposition (WSPD) span-ners. Given a point set P…

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…

2013

The well-separated pair decomposition (WSPD) is a fundamental structure in computational geometry. Given a set P of n points in d…

2013

We investigate the unsupervised K-means clustering and the semi-supervised hidden Markov model (HMM) to automatically detect…

2010

K-Means is a popular clustering algorithm which adopts an iterative refinement procedure to determine data partitions and to…

2007

2007

We implemented the well-separated pair decomposition algorithm described by Callahan and Kosaraju 1]. We then tested the…

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…