Approximating Minimization Diagrams and Generalized Proximity Search

@inproceedings{HarPeled2013ApproximatingMD,
  title={Approximating Minimization Diagrams and Generalized Proximity Search},
  author={Sariel Har-Peled and Nirman Kumar},
  booktitle={FOCS},
  year={2013}
}
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… Expand
Approximating Minimization Diagrams and Generalized Proximity Search
TLDR
A general framework and a data-structure are presented that can be used to approximate the minimization diagram of such functions as the Voronoi diagram of (additively or multiplicatively) weighted points and the nearest furthest-neighbor distance to a set of point sets. Expand
Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances
TLDR
A new approach to e-approximate nearest-neighbor queries in fixed dimension under a variety of non-Euclidean distances is presented by a careful application of convexification, which appears to be relatively new to computational geometry. Expand
Approximate nearest neighbor search for $\ell_p$-spaces ($2 < p < \infty$) via embeddings
TLDR
This paper presents approximate nearest-neighbor search algorithms which give the first non-trivial approximation factor guarantees in this setting and revisits this fundamental problem. Expand

References

SHOWING 1-10 OF 31 REFERENCES
Approximating Minimization Diagrams and Generalized Proximity Search
TLDR
A general framework and a data-structure are presented that can be used to approximate the minimization diagram of such functions as the Voronoi diagram of (additively or multiplicatively) weighted points and the nearest furthest-neighbor distance to a set of point sets. Expand
Approximate nearest neighbors: towards removing the curse of dimensionality
TLDR
Two algorithms for the approximate nearest neighbor problem in high-dimensional spaces are presented, which require space that is only polynomial in n and d, while achieving query times that are sub-linear inn and polynometric in d. Expand
Geometric Approximation Algorithms
Exact algorithms for dealing with geometric objects are complicated, hard to implement in practice, and slow. Over the last 20 years a theory of geometric approximation algorithms has emerged. TheseExpand
A replacement for Voronoi diagrams of near linear size
  • Sariel Har-Peled
  • Computer Science
  • Proceedings 2001 IEEE International Conference on Cluster Computing
  • 2001
TLDR
A new type of space decomposition that provides an /spl epsi/-approximation to the distance function associated with the Voronoi diagram of P, while being of near linear size, for d/spl ges/2. Expand
Nearest-Neighbor Searching and Metric Space Dimensions
Given a set S of points in a metric space with distance function D, the nearest-neighbor searching problem is to build a data structure for S so that for an input query point q, the point s 2 S thatExpand
Approximate clustering via core-sets
TLDR
It is shown that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering efficiently and are a substantial improvement over what was previously known. Expand
Nearest-neighbor searching under uncertainty
TLDR
This work presents methods for computing an exact ENN or an ε-approximate ENN, for a given error parameter 0 < ε 0 < 1, under different distance functions and presents these methods as the first nontrivial methods for answering exact or ε -approximates ENN queries with provable performance guarantees. Expand
Efficient partition trees
We prove a theorem on partitioning point sets inEd (d fixed) and give an efficient construction of partition trees based on it. This yields a simplex range searching structure with linear space,O(nExpand
Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality
TLDR
Two algorithms for the approximate nearest neighbor problem in high dimensional spaces for data sets of size n living in IR are presented, achieving query times that are sub-linear in n and polynomial in d. Expand
Constructing approximate shortest path maps in three dimensions
TLDR
An algorithm is presented that computes a subdivision of R 3, which can be used to answer eciently approximate shortest path queries, and a distanceO;s(t) that "-approximates the length of a shortest path from s to t that avoids the interiors of the obstacles". Expand
...
1
2
3
4
...