Approximating minimization diagrams and generalized proximity search
We investigate the classes of functions whose minimization diagrams can be approximated efficiently in ℝd. 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 multiplicatively weighted points, but the new technique also works for more general distance functions. For example, we get such data-structures for metrics induced by convex bodies, and the nearest furthest-neighbor distance to a set of point sets. Interestingly, our framework also works for distance functions that do not obey the triangle inequality. For many of these functions no near linear size approximation was known before.
SIAM Journal on Computing
Har-Peled, S., & Kumar, N. (2015). Approximating minimization diagrams and generalized proximity search. SIAM Journal on Computing, 44 (4), 944-974. https://doi.org/10.1137/140959067