Mad at Edge Crossings? Break the Edges!
One of the main principles for the effective visualization of graphs is the avoidance of edge crossings. Around this problem, very active research has been performed with works ranging from combinatorics, to algorithmics, visualization effects, to psychological user studies. Recently, the pragmatic approach has been proposed to avoid crossings by drawing the edges only partially. Unfortunately, no formal model and efficient algorithms have been formulated to this end. We introduce the concept for drawings of graphs with partially drawn edges (PED). Therefore we consider graphs with and without given embedding and characterize PEDs with concepts like symmetry and homogeneity. For graphs without embedding we formulate a sufficient condition to guarantee a symmetric homogeneous PED, and identify a nontrivial graph class which has a symmetric homogeneous PED. For graphs with given layout we consider the variants of maximizing the shortest partially drawn edge and the total length respectively.
KeywordsIntersection Point Small Circle Intersection Graph Maximal Match Graph Class
Unable to display preview. Download preview PDF.
- 1.Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall (1999)Google Scholar
- 3.Brandes, U., Erten, C., Estrella-Balderrama, A., Fowler, J.J., Frati, F., Geyer, M., Gutwenger, C., Hong, S.H., Kaufmann, M., Kobourov, S.G., Liotta, G., Mutzel, P., Symvonis, A.: Colored simultaneous geometric embeddings and universal pointsets. Algorithmica 60(3), 569–592 (2011)MathSciNetMATHCrossRefGoogle Scholar
- 4.Burch, M., Vehlow, C., Konevtsova, N., Weiskopf, D.: Evaluating Partially Drawn Links for Directed Graph Edges. In: van Kreveld, M., Speckmann, B. (eds.) GD 2011. LNCS, vol. 7034, pp. 226–237. Springer, Heidelberg (2011)Google Scholar
- 13.Koffka, K.: Principles of Gestalt Psychology. International Library of Psychology, Philosophy and Scientific Method (1999), http://books.google.de/books?id=cLnqI3dvi4kC
- 15.Peng, D., Lua, N., Chen, W., Peng, Q.: Sideknot: Revealing relation patterns for graph visualization. To appear in IEEE Pacific Visualization Symposium (2012)Google Scholar
- 16.Rusu, A., Fabian, A.J., Jianu, R., Rusu, A.: Using the gestalt principle of closure to alleviate the edge crossing problem in graph drawings. In: International Conference on Information Visualisation, pp. 488–493 (2011)Google Scholar
- 17.yWorks GmbH: yFiles graph library, http://www.yworks.com