  The \emph{local edge-length ratio} of a planar straight-line drawing $\Gamma$
is the largest ratio between the lengths of any pair of edges of $\Gamma$ that
share a common vertex. The \emph{global edge-length ratio} of $\Gamma$ is the
largest ratio between the lengths of any pair of edges of $\Gamma$. The local
(global) edge-length ratio of a planar graph is the infimum over all local
(global) edge-length ratios of its planar straight-line drawings. We show that
there exist planar graphs with $n$ vertices whose local edge-length ratio is
$\Omega(\sqrt{n})$. We then show a technique to establish upper bounds on the
global (and hence local) edge-length ratio of planar graphs and~apply~it to
Halin graphs and to other families of graphs having outerplanarity two.
