Drawing Graphs on Few Circles and Few Spheres release_yxl6kqdhzjhilbke3b2ht77sc4

by Myroslav Kryven, Alexander Ravsky, Alexander Wolff

Released as a article .

2017  

Abstract

Given a drawing of a graph, its visual complexity is defined as the number of geometrical entities in the drawing, for example, the number of segments in a straight-line drawing or the number of arcs in a circular-arc drawing (in 2D). Recently, Chaplick et al. [GD 2016] introduced a different measure for the visual complexity, the affine cover number, which is the minimum number of lines (or planes) that together cover a crossing-free straight-line drawing of a graph G in 2D (3D). In this paper, we introduce the spherical cover number, which is the minimum number of circles (or spheres) that together cover a crossing-free circular-arc drawing in 2D (or 3D). It turns out that spherical covers are sometimes significantly smaller than affine covers. Moreover, there are highly symmetric graphs that have symmetric optimum spherical covers but apparently no symmetric optimum affine cover. For complete, complete bipartite, and platonic graphs, we analyze their spherical cover numbers and compare them to their affine cover numbers as well as their segment and arc numbers. We also link the spherical cover number to other graph parameters such as chromatic number, treewidth, and linear arboricity.
In text/plain format

Archived Files and Locations

application/pdf  592.5 kB
file_dgimsojaefhv7aeihcxjeuhqdu
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2017-09-20
Version   v1
Language   en ?
arXiv  1709.06965v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 56924f1c-7906-416b-adde-2e1471e597e5
API URL: JSON