Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 210,180,392 papers from all fields of science

Search

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…

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…

2009

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…

2008

2008

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

2006

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…

2003

2003

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

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…

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…

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…

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…