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. [4] 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Akiyama, J., Exoo, G., Harary, F.: Covering and packing ingraphs III: cyclic and acyclic invariants. Math. Slovaca 30, 405–417 (1980)
Bernhart, F., Kainen, P.C.: The book thickness of a graph. J. Combin. Theory Ser. B 27(3), 320–331 (1979). http://www.sciencedirect.com/science/article/pii/0095895679900212
Brannan, D.A.: Geometry. Cambridge University Press, Cambridge (1999)
Chaplick, S., Fleszar, K., Lipp, F., Ravsky, A., Verbitsky, O., Wolff, A.: Drawing graphs on few lines and few planes. In: Hu, Y., Nöllenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 166–180. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-50106-2_14
Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Upper Saddle River (1999)
Dujmović, V., Eppstein, D., Suderman, M., Wood, D.: Drawings of planar graphs with few slopes and segments. Comput. Geom. Theory Appl. 38, 194–212 (2007)
Duncan, C.A.: On graph thickness, geometric thickness, and separator theorems. Comput. Geom. Theory Appl. 44(2), 95–99 (2011). http://www.sciencedirect.com/science/article/pii/S0925772110000738
Edelsbrunner, H.: Lecture notes for Computational Topology (CPS296.1) (2006). http://www.cs.duke.edu/courses/fall06/cps296.1/Lectures/sec-III-3.pdf
Flum, J., Grohe, M.: Parametrized Complexity Theory. Springer, Heidelberg (2006). https://doi.org/10.1007/3-540-29953-X
Harary, F.: Covering and packing in graphs I. Ann. N.Y. Acad. Sci. 175, 198–205 (1970)
Harary, F.: A Seminar on Graph Theory. Dover Publications, New York (2015)
Hoffmann, M., van Kreveld, M., Kusters, V., Rote, G.: Quality ratios of measures for graph drawing styles. In: CCCG 2014, pp. 33–39 (2014). http://www.cccg.ca/proceedings/2014/papers/paper05.pdf
Igamberdiev, A., Meulemans, W., Schulz, A.: Drawing planar cubic 3-connected graphs with few segments: algorithms and experiments. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 113–124. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-27261-0_10
Kindermann, P., Meulemans, W., Schulz, A.: Experimental analysis of the accessibility of drawings with few segments. In: Frati, F., Ma, K.L. (eds.) GD 2017. LNCS, vol. 10692. Springer (to appear, 2018). arxiv.org/abs/1708.09815
Kostochka, A.V., Melnikov, L.S.: On a lower bound for the isoperimetric number of cubic graphs. In: Proceedings of the 3rd International Petrozavodsk Conference on Probabilistic Methods in Discrete Mathematics, pp. 251–265. TVP, VSP, Moskva, Utrecht (1993)
Kryven, M., Ravsky, A., Wolff, A.: Drawing graphs on few circles and few spheres. ArXiv e-print arxiv.org/abs/1709.06965 (2017)
Mondal, D., Nishat, R.I., Biswas, S., Rahman, M.S.: Minimum-segment convex drawings of 3-connected cubic plane graphs. J. Comb. Opt. 25(3), 460–480 (2013). https://doi.org/10.1007/s10878-011-9390-6
Moscow Mathematical Olympiad, problem no. 78223 (1960). http://www.problems.ru/view_problem_details_new.php?id=78223 (in Russian)
Scherm, U.: Minimale Überdeckung von Knoten und Kanten in Graphen durch Geraden. Bachelor’s Thesis, Institut für Informatik, Universität Würzburg (2016)
Schulz, A.: Drawing graphs with few arcs. J. Graph Alg. Appl. 19(1), 393–412 (2015)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Kryven, M., Ravsky, A., Wolff, A. (2018). Drawing Graphs on Few Circles and Few Spheres. In: Panda, B., Goswami, P. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2018. Lecture Notes in Computer Science(), vol 10743. Springer, Cham. https://doi.org/10.1007/978-3-319-74180-2_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-74180-2_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-74179-6
Online ISBN: 978-3-319-74180-2
eBook Packages: Computer ScienceComputer Science (R0)