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

Haim Kaplan, Wolfgang Mulzer*, Liam Roditty, Paul Seiferth, Micha Sharir

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

23 Scopus citations


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 Lp-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) storage, and requires polylogarithmic update and query time, improving an earlier data structure of Agarwal, Efrat, and Sharir which required O(nε) time for an update and 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ε) 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. To obtain this data structure, we combine and extend various techniques from the literature. Along the way, we obtain several side results that are of independent interest. Our data structure depends on the existence and an efficient construction of “vertical” shallow cuttings in arrangements of bivariate algebraic functions. We prove that an appropriate level in an arrangement of a random sample of a suitable size provides such a cutting. To compute it efficiently, we develop a randomized incremental construction algorithm for computing the lowest k levels in an arrangement of bivariate algebraic functions (we mostly consider here collections of functions whose lower envelope has linear complexity, as is the case in the dynamic nearest-neighbor context, under both types of norm). To analyze this algorithm, we also improve a longstanding bound on the combinatorial complexity of the vertical decomposition of these levels. Finally, to obtain our structure, we combine our vertical shallow cutting construction with Chan’s algorithm for efficiently maintaining the lower envelope of a dynamic set of planes in R3. Along the way, we also revisit Chan’s technique and present a variant that uses a single binary counter, with a simpler analysis and improved amortized deletion time (by a logarithmic factor; the insertion and query costs remain asymptotically the same).

Original languageEnglish
Pages (from-to)838-904
Number of pages67
JournalDiscrete and Computational Geometry
Issue number3
StatePublished - 1 Oct 2020


FundersFunder number
German–Israeli Science Foundation
Horizon 2020 Framework Programme757609
European Research Council2012/229
Deutsche Forschungsgemeinschaft
German-Israeli Foundation for Scientific Research and Development1367/2016, 1161/2011
United States-Israel Binational Science Foundation260/18
Israel Science Foundation822-10, 1841-14, 892/13
Tel Aviv University
Israeli Centers for Research Excellence4/11, MU/3501/1


    • Dynamic structure
    • General distance functions
    • Voronoi diagram


    Dive into the research topics of 'Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic Applications'. Together they form a unique fingerprint.

    Cite this