  The Voronoi diagrams technique was introduced by Cabello to compute the
diameter of planar graphs in subquadratic time. We present novel applications
of this technique in static, fault-tolerant, and partially-dynamic undirected
unweighted planar graphs, as well as some new limitations.
  1. In the static case, we give $n^{3+o(1)}/D^2$ and $\tilde{O}(n\cdot D^2)$
time algorithms for computing the diameter of a planar graph $G$ with diameter
$D$. These are faster than the state of the art $\tilde{O}(n^{5/3})$ when
$D<n^{1/3}$ or $D>n^{2/3}$.
  2. In the fault-tolerant setting, we give an $n^{7/3+o(1)}$ time algorithm
for computing the diameter of $G\setminus \{e\}$ for every edge $e$ in $G$ the
replacement diameter problem. Compared to the naive $\tilde{O}(n^{8/3})$ time
algorithm that runs the static algorithm for every edge.
  3. In the incremental setting, where we wish to maintain the diameter while
while adding edges, we present an algorithm with total running time
$n^{7/3+o(1)}$. Compared to the naive $\tilde{O}(n^{8/3})$ time algorithm that
runs the static algorithm after every update.
  4. We give a lower bound (conditioned on the SETH) ruling out an amortized
$O(n^{1-\varepsilon})$ update time for maintaining the diameter in *weighted*
planar graph. The lower bound holds even for incremental or decremental
updates.
  Our upper bounds are obtained by novel uses and manipulations of Voronoi
diagrams. These include maintaining the Voronoi diagram when edges of the graph
are deleted, allowing the sites of the Voronoi diagram to lie on a BFS tree
level (rather than on boundaries of $r$-division), and a new reduction from
incremental diameter to incremental distance oracles that could be of interest
beyond planar graphs. Our lower bound is the first lower bound for a dynamic
planar graph problem that is conditioned on the SETH.
