Approximating Minimization Diagrams and Generalized Proximity Search

We investigate the classes of functions whose minimization diagrams can be approximated efficiently in Red. We present a general framework and a data-structure that can be used to approximate the minimization diagram of such functions. The resulting data-structure has near linear size and can answer queries in logarithmic time. Applications include approximating the Voronoi diagram of (additively or multiplicatively) weighted points. Our technique also works for more general distance functions, such as metrics induced by convex bodies, and the nearest furthest-neighbor distance to a set of point sets. Interestingly, our framework works also for distance functions that do not obey the triangle inequality. For many of these functions no near-linear size approximation was known before.

[1]  Sariel Har-Peled.  A replacement for Voronoi diagrams of near linear size , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[2]  Piotr Indyk,et al.  Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.

[3]  Sariel Har-Peled,et al.  Constructing approximate shortest path maps in three dimensions , 1998, SCG '98.

[4]  Jeff Erickson,et al.  New lower bounds for Hopcroft's problem , 1995, SCG '95.

[5]  Sunil Arya,et al.  Linear-size approximate voronoi diagrams , 2002, SODA '02.

[6]  D. S. Arnon,et al.  Algorithms in real algebraic geometry , 1988 .

[7]  Sunil Arya,et al.  An optimal algorithm for approximate nearest neighbor searching fixed dimensions , 1998, JACM.

[8]  Sariel Har-Peled.  Geometric Approximation Algorithms , 2011 .

[9]  Christopher Ré,et al.  Probabilistic databases: diamonds in the dirt , 2009, CACM.

[10]  Rajeev Motwani,et al.  Lower bounds on locality sensitive hashing , 2005, SCG '06.

[11]  Charu C. Aggarwal,et al.  Managing and Mining Uncertain Data , 2009, Advances in Database Systems.

[12]  D. Vernon.  Inform , 1995, Encyclopedia of the UN Sustainable Development Goals.

[13]  Timothy M. Chan.  Optimal Partition Trees , 2010, SCG.

[14]  S. Meiser,et al.  Point Location in Arrangements of Hyperplanes , 1993, Inf. Comput..

[15]  Sunil Arya,et al.  Space-time tradeoffs for approximate nearest neighbor searching , 2009, JACM.

[16]  Sariel Har-Peled,et al.  Approximating Minimization Diagrams and Generalized Proximity Search , 2013, FOCS.

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

[18]  K. Clarkson.  Nearest-Neighbor Searching and Metric Space Dimensions , 2005 .

[19]  Jirí Matousek,et al.  Ray shooting and parametric search , 1992, STOC '92.

[20]  Pankaj K. Agarwal,et al.  Nearest-neighbor searching under uncertainty , 2012, PODS.

[21]  Trevor Darrell,et al.  Nearest-Neighbor Searching and Metric Space Dimensions , 2006 .

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

[23]  Micha Sharir,et al.  Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.

[24]  Pankaj K. Agarwal,et al.  Geometric Range Searching and Its Relatives , 2007 .

[25]  Alexandr Andoni,et al.  Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[26]  Jirí Matousek,et al.  Efficient partition trees , 1991, SCG '91.

[27]  Piotr Indyk,et al.  Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality , 2012, Theory Comput..

[28]  Kenneth L. Clarkson,et al.  A Randomized Algorithm for Closest-Point Queries , 1988, SIAM J. Comput..