论文信息 - Fast Algorithms for Approximating Distances

Fast Algorithms for Approximating Distances

In this paper we present efficient approximation algorithms for the distance selection problem. Our technique is based on the well-separated pair decomposition proposed in [8].

Sergey Bereg | Michael Segal | M. Segal | S. Bereg

[1] S. Rao Kosaraju,et al. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields , 1995, JACM.

[2] Jon Louis Bentley,et al. Decomposable Searching Problems , 1979, Inf. Process. Lett..

[3] Micha Sharir,et al. An Expander-Based Approach to Geometric Optimization , 1997, SIAM J. Comput..

[4] Sunil Arya,et al. Approximate range searching , 1995, SCG '95.

[5] Jeff Erickson,et al. On the relative complexities of some geometric problems , 1995, CCCG.

[6] Paul B. Callahan,et al. Dealing with higher dimensions: the well-separated pair decomposition and its applications , 1995 .

[7] Nimrod Megiddo,et al. Applying parallel computation algorithms in the design of serial algorithms , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[8] Michael T. Goodrich. Geometric partitioning made easier, even in parallel , 1993, SCG '93.

[9] S. Rao Kosaraju,et al. Faster algorithms for some geometric graph problems in higher dimensions , 1993, SODA '93.

[10] Timothy M. Chan. On enumerating and selecting distances , 1998, SCG '98.

[11] Micha Sharir,et al. The Discrete 2-Center Problem , 1997, SCG '97.

[12] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .