Create and explore imaginative 3D worlds with our new product Dreamfield (opens in a new tab)
Papers
Topics
Authors
Recent
Search
2000 character limit reached

Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications

Published 13 Apr 2016 in cs.CG and cs.DS | (1604.03654v4)

Abstract: We describe a new data structure for dynamic nearest neighbor queries in the plane with respect to a general family of distance functions. These include LpL_p-norms and additively weighted Euclidean distances. Our data structure supports general (convex, pairwise disjoint) sites that have constant description complexity (e.g., points, line segments, disks, etc.). Our structure uses O(nlog⁡3n)O(n \log^3 n) storage, and requires polylogarithmic update and query time, improving an earlier data structure of Agarwal, Efrat and Sharir that required O(nε)O(n^\varepsilon) time for an update and O(log⁡n)O(\log n) time for a query [SICOMP, 1999]. Our data structure has numerous applications. In all of them, it gives faster algorithms, typically reducing an O(nε)O(n^\varepsilon) factor in the previous bounds to polylogarithmic. In addition, we give here two new applications: an efficient construction of a spanner in a disk intersection graph, and a data structure for efficient connectivity queries in a dynamic disk graph.

Citations (65)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.