Voronoi diagrams on planar graphs, and computing the diameter in deterministic Õ (n5/3) time

Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


We present an efficient construction of additively weighted Voronoi diagrams on planar graphs. Let G be a planar graph with n vertices and b sites that lie on a constant number of faces. We show how to preprocess G in Õ (nb2) time1 so that one can compute any additively weighted Voronoi diagram for these sites in Õ(b) time. We use this construction to compute the diameter of a directed planar graph with real arc lengths in O(n5/3) time. This improves the recent breakthrough result of Cabello (SODA'17), both by improving the running time (from Õ (n11/6)), and by providing a deterministic algorithm. It is in fact the first truly subquadratic deterministic algorithm for this problem. Our use of Voronoi diagrams to compute the diameter follows that of Cabello, but he used abstract Voronoi diagrams, which makes his diameter algorithm more involved, more expensive, and randomized. As in Cabello's work, our algorithm can also compute the Wiener index of a planar graph (i.e., the sum of all pairwise distances) within the same bound. Our construction of Voronoi diagrams for planar graphs is of ndependent interest. It has already been used to obtain fast exact distance oracles for planar graphs [Cohen-Addad et al., FOCS'17].

Original languageEnglish
Title of host publication29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018
EditorsArtur Czumaj
PublisherAssociation for Computing Machinery
Number of pages20
ISBN (Electronic)9781611975031
StatePublished - 2018
Event29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018 - New Orleans, United States
Duration: 7 Jan 201810 Jan 2018

Publication series

NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms


Conference29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018
Country/TerritoryUnited States
CityNew Orleans

Bibliographical note

Funding Information:
†Tel AvivUniversity, Blavatnik School of Computer Science, {haimk,michas}@post.tau.ac.il. Partiallysupported byLen Blavatnikand theBlavatnik Research FundinComputer Science atTel Aviv University, by the IsraeliCenters of Research Excellence(I-CORE)program(center No. 4/11), by theIsrael Science Foundation (grant No. 1841-14), by GIF (grantno. 1161 and 1367), and bythe HermannMinkowski-MINERVACenter for Geometry at Tel AvivUniversity.

Funding Information:
‡InterdisciplinaryCenter Herzliya, EfiAraziSchool ofCom-puter Science, smozes@idc.ac.il. Partiallysupported by the Is-raelScience Foundation (grant No. 794/13 and 592/17). 1TheÕ notation hidespolylogarithmicfactors.

Funding Information:
∗UniversityofHaifa, DepartmentofComputer Science, gawry@mimuw.edu.pl,oren@cs.haifa.ac.il. Partially supported by the IsraelScience Foundation (grant No. 794/13 and 592/17).

Publisher Copyright:
© Copyright 2018 by SIAM.

ASJC Scopus subject areas

  • Software
  • Mathematics (all)


Dive into the research topics of 'Voronoi diagrams on planar graphs, and computing the diameter in deterministic Õ (n5/3) time'. Together they form a unique fingerprint.

Cite this