Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

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

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

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

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

2005

2005

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

We extend the classic notion of well-separated pair decomposition [10] to the (weighted) unit-disk graph metric: the shortest… Expand

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

Highly Cited

1996

Highly Cited

1996

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

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

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