Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions

Pankaj K. Agarwal, Haim Kaplan, Natan Rubin, Micha Sharir

Research output: Contribution to journalArticlepeer-review

9 Scopus citations


Let P be a set of n points and Q a convex k-gon in R2. We analyze in detail the topological (or discrete) changes in the structure of the Voronoi diagram and the Delaunay triangulation of P, under the convex distance function defined by Q, as the points of P move along prespecified continuous trajectories. Assuming that each point of P moves along an algebraic trajectory of bounded degree, we establish an upper bound of O(k4r(n)) on the number of topological changes experienced by the diagrams throughout the motion; here λr(n) is the maximum length of an (n, r)-Davenport–Schinzel sequence, and r is a constant depending on the algebraic degree of the motion of the points. Finally, we describe an algorithm for efficiently maintaining the above structures, using the kinetic data structure (KDS) framework.

Original languageEnglish
Pages (from-to)871-904
Number of pages34
JournalDiscrete and Computational Geometry
Issue number4
StatePublished - 8 Sep 2015


  • Convex distance function
  • Delaunay triangulation
  • Discrete changes
  • Kinetic data structure
  • Moving points
  • Voronoi diagram

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics


Dive into the research topics of 'Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions'. Together they form a unique fingerprint.

Cite this