Abstract
We study a three-dimensional analogue to the well-known graph visualization approach known as arc diagrams. We provide several algorithms that achieve good angular resolution for 3D arc diagrams, even for cases when the arcs must project to a given 2D straight-line drawing of the input graph. Our methods make use of various graph coloring algorithms, including an algorithm for a new coloring problem, which we call localized edge coloring.
Chapter PDF
References
Angelini, P., Eppstein, D., Frati, F., Kaufmann, M., Lazard, S., Mchedlidze, T., Teillaud, M., Wolff, A.: Universal point sets for planar graph drawings with circular arcs (2013) (manuscript)
Brandes, U.: Hunting down Graph B. In: Kratochvíl, J. (ed.) GD 1999. LNCS, vol. 1731, pp. 410–415. Springer, Heidelberg (1999)
Brandes, U., Shubina, G., Tamassia, R.: Improving angular resolution in visualizations of geographic networks. In: Leeuw, W., Liere, R. (eds.) Data Visualization, Eurographics, pp. 23–32. Springer (2000)
Brandes, U., Shubina, G., Tamassia, R.: Improving angular resolution in visualizations of geographic networks. In: Proc. Joint Eurographics — IEEE TCVG Symposium on Visualization (VisSym 2000) (2000)
Cheng, C., Duncan, C., Goodrich, M., Kobourov, S.: Drawing planar graphs with circular arcs. Discrete & Computational Geometry 25(3), 405–418 (2001)
Cimikowski, A., Shope, P.: A neural-network algorithm for a graph layout problem. IEEE Trans. on Neural Networks 7(2), 341–345 (1996)
Cohen, R., Eades, P., Lin, T., Ruskey, F.: Three-dimensional graph drawing. Algorithmica 17(2), 199–208 (1997)
Djidjev, H.N., Vrt’o, I.: An improved lower bound for crossing numbers. In: Mutzel, P., Jünger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 96–101. Springer, Heidelberg (2002)
Duncan, C.A., Eppstein, D., Goodrich, M.T., Kobourov, S.G., Löffler, M.: Planar and poly-arc Lombardi drawings. In: Speckmann, B. (ed.) GD 2011. LNCS, vol. 7034, pp. 308–319. Springer, Heidelberg (2011)
Duncan, C.A., Eppstein, D., Goodrich, M.T., Kobourov, S.G., Nöllenburg, M.: Drawing trees with perfect angular resolution and polynomial area. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 183–194. Springer, Heidelberg (2011)
Duncan, C.A., Eppstein, D., Goodrich, M.T., Kobourov, S.G., Nöllenburg, M.: Lombardi drawings of graphs. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 195–207. Springer, Heidelberg (2011)
Eppstein, D., Löffler, M., Mumford, E., Nöllenburg, M.: Optimal 3d angular resolution for low-degree graphs. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 208–219. Springer, Heidelberg (2011)
Fejes Tóth, L.: Über die Abschätzung des kürzesten Abstandes zweier Punkte eneis auf einer Kugelfläche liegenden Punktsystems. Jbf. Deutsch. Math. Verein 53, 66–68 (1943)
Formann, M., Hagerup, T., Haralambides, J., Kaufmann, M., Leighton, F.T., Symvonis, A., Welzl, E., Woeginger, G.J.: Drawing graphs in the plane with high resolution. In: FOCS, pp. 86–95. IEEE Computer Society (1990)
Garg, A., Tamassia, R.: Planar drawings and angular resolution: Algorithms and bounds. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol. 855, pp. 12–23. Springer, Heidelberg (1994)
Garg, A., Tamassia, R., Vocca, P.: Drawing with colors. In: Díaz, J. (ed.) ESA 1996. LNCS, vol. 1136, pp. 12–26. Springer, Heidelberg (1996)
Goodrich, M.T., Wagner, C.G.: A framework for drawing planar graphs with curves and polylines. Journal of Algorithms 37(2), 399–421 (2000)
Gutwenger, C., Mutzel, P.: Planar polyline drawings with good angular resolution. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 167–182. Springer, Heidelberg (1999)
Nicholson, T.: Permutation procedure for minimising the number of crossings in a network. Proc. of the Inst. of Electrical Engineers 115(1), 21–26 (1968)
Saaty, T.L.: The minimum number of intersections in complete graphs. Proceedings of the National Academy of Sciences of the United States of America 52(3), 688–690 (1964)
Tammes, P.: On the origin of number and arrangements of the places of exit on the surface of pollen grains. Rec. Trav. Bot. Neerl. 27, 1–81 (1930)
Vizing, V.G.: On an estimate of the chromatic class of a p-graph. Diskret. Analiz. 3, 25–30 (1964)
Wattenberg, M.: Arc diagrams: Visualizing structure in strings. In: IEEE Symp. on Information Visualization (InfoVis), pp. 110–116 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Goodrich, M.T., Pszona, P. (2013). Achieving Good Angular Resolution in 3D Arc Diagrams. In: Wismath, S., Wolff, A. (eds) Graph Drawing. GD 2013. Lecture Notes in Computer Science, vol 8242. Springer, Cham. https://doi.org/10.1007/978-3-319-03841-4_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-03841-4_15
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03840-7
Online ISBN: 978-3-319-03841-4
eBook Packages: Computer ScienceComputer Science (R0)