Grid Drawings of Graphs with Constant Edge-Vertex Resolution

05/05/2020
by   Michael A. Bekos, et al.
National Technical University of Athens
University of Cologne
Universität Tübingen
Università Perugia
0

We study the algorithmic problem of computing drawings of graphs in which (i) each vertex is a disk with constant radius r, (ii) each edge is a straight-line segment connecting the centers of the two disks representing its end-vertices, (iii) no two disks intersect, and (iv) the edge-vertex resolution is at least r, that is, no edge segment intersects a non-adjacent disk. We call such drawings disk-link drawings. This model is motivated by the fact that common graph editors represent vertices as geometric features (usually either as disks or as squares) of fixed size. In this scenario, vertex-vertex and edge-vertex overlaps cause visual clutter and may generate ambiguities. Since such issues can be solved by scaling up the drawing by a suitable factor, we present constructive techniques that yield more compact upper bounds for the area requirements of disk-link drawings for several (planar and nonplanar) graph classes, including proper level, bounded bandwidth, complete, planar and outerplanar graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

04/29/2022

Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution

We continue the study of the area requirement of convex straight-line gr...
08/09/2019

On the Edge-Length Ratio of Planar Graphs

The edge-length ratio of a straight-line drawing of a graph is the ratio...
07/13/2020

Asymptotically Optimal Vertex Ranking of Planar Graphs

A (vertex) ℓ-ranking is a labelling φ:V(G)→ℕ of the vertices of a graph ...
02/13/2020

Drawing Graphs as Spanners

We study the problem of embedding graphs in the plane as good geometric ...
09/05/2023

Computing Hive Plots: A Combinatorial Framework

Hive plots are a graph visualization style placing vertices on a set of ...
07/27/2021

The Space Complexity of Sum Labelling

A graph is called a sum graph if its vertices can be labelled by distinc...
06/08/2021

Morphing tree drawings in a small 3D grid

We study crossing-free grid morphs for planar tree drawings using 3D. A ...

Please sign up or login with your details

Forgot password? Click here to reset