DeepAI
Log In Sign Up

On the Edge-Length Ratio of Planar Graphs

08/09/2019
by   Manuel Borrazzo, et al.
0

The edge-length ratio of a straight-line drawing of a graph is the ratio between the lengths of the longest and of the shortest edge in the drawing. The planar edge-length ratio of a planar graph is the minimum edge-length ratio of any planar straight-line drawing of the graph. In this paper, we study the planar edge-length ratio of planar graphs. We prove that there exist n-vertex planar graphs whose planar edge-length ratio is in Ω(n); this bound is tight. We also prove upper bounds on the planar edge-length ratio of several families of planar graphs, including series-parallel graphs and bipartite planar graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

08/31/2017

On the Edge-length Ratio of Outerplanar Graphs

We show that any outerplanar graph admits a planar straightline drawing ...
08/28/2021

Planar Straight-line Realizations of 2-Trees with Prescribed Edge Lengths

We study a classic problem introduced thirty years ago by Eades and Worm...
02/13/2020

Drawing Graphs as Spanners

We study the problem of embedding graphs in the plane as good geometric ...
09/24/2019

On the edge-length ratio of 2-trees

We study planar straight-line drawings of graphs that minimize the ratio...
06/11/2019

Bipartite and Series-Parallel Graphs Without Planar Lombardi Drawings

We find a family of planar bipartite graphs all of whose Lombardi drawin...
02/28/2019

On the Area Requirements of Planar Straight-Line Orthogonal Drawings of Ternary Trees

In this paper, we study the area requirements of planar straight-line or...
05/05/2020

Grid Drawings of Graphs with Constant Edge-Vertex Resolution

We study the algorithmic problem of computing drawings of graphs in whic...