A Coloring Algorithm for Disambiguating Graph and Map Drawings

Hu, Yifan and Shi, Lei (2014) A Coloring Algorithm for Disambiguating Graph and Map Drawings. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014, Würzburg, Germany , pp. 89-100 (Official URL: http://dx.doi.org/10.1007/978-3-662-45803-7_8).

Full text not available from this repository.


Drawings of non-planar graphs always result in edge crossings.When there are many edges crossing at small angles, it is often difficult to follow these edges, because of the multiple visual paths resulted from the crossings that slow down eye movements. In this paper we propose an algorithm that disambiguates the edges with automatic selection of distinctive colors. Our proposed algorithm computes a near optimal color assignment of a dual collision graph, using a novel branch-and-bound procedure applied to a space decomposition of the color gamut. We conduct a user study to establish the effectiveness and limitations of this approach in clarifying drawings of real world graphs and maps

Item Type:Conference Paper
Additional Information:10.1007/978-3-662-45803-7_8
Classifications:D Aesthetics > D.999 Others
G Algorithms and Complexity > G.420 Crossings
G Algorithms and Complexity > G.999 Others
ID Code:1424

Repository Staff Only: item control page


Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Algorithms for the Visualization of Graphs. Prentice-Hall (1999)

Brewer, C.: ColorBrewer - Color Advice for Maps, http://www.colorbrewer2.org

Chernobelskiy, R., Cunningham, K.I., Goodrich, M.T., Kobourov, S.G., Trott, L.: Force-directed lombardi-style graph drawing. In: Speckmann, B. (ed.) GD 2011. LNCS, vol. 7034, pp. 320–331. Springer, Heidelberg (2011)

Davis, T.A., Hu, Y.: University of Florida Sparse Matrix Collection. ACM Transaction on Mathematical Software 38, 1–18 (2011)

Di Battista, G., Vismara, L.: Angles of planar triangular graphs. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, STOC 1993, pp. 431–437. ACM, New York (1993)

Didimo, W., Eades, P., Liotta, G.: Drawing graphs with right angle crossings. Theor. Comput. Sci. 412(39), 5156–5166 (2011)

Dillencourt, M.B., Eppstein, D., Goodrich, M.T.: Choosing colors for geometric graphs via color space embeddings. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 294–305. Springer, Heidelberg (2007)

Duncan, C., Eppstein, D., Goodrich, M.T., Kobourov, S., Nöllenburg, M.: Lombardi drawings of graphs. J. Graph Algorithms and Applications 16, 85–108 (2012)

Gansner, E.R., Hu, Y., Kobourov, S.: Visualizing Graphs and Clusters as Maps. IEEE Computer Graphics and Applications 30, 54–66 (2010)

Gansner, E.R., North, S.: An open graph visualization system and its applications to software engineering. Software - Practice & Experience 30, 1203–1233 (2000)

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)

Hu, Y., Kobourov, S., Veeramoni, S.: On maximum differential graph coloring. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 274–286. Springer, Heidelberg (2011)

Hu, Y., Shi, L. (2014), http://arxiv.org/abs/1409.0436

Huang, W.: Using eye tracking to investigate graph layout effects. In: 2007 6th International Asia-Pacific Symposium on Visualization, APVIS 2007, pp. 97–100 (2007)

Huang, W., Hong, S.-H., Eades, P.: Effects of crossing angles. In: Proceedings of IEEE Pacific Visualization Symposium, pp. 41–46. IEEE (2008)

Jianu, R., Rusu, A., Fabian, A.J., Laidlaw, D.H.: A coloring solution to the edge crossing problem. In: Proceedings of the 13th International Conference in Information Visualization (iV 2009), pp. 691–696. IEEE Computer Society (2009)

Moscovich, T., Chevalier, F., Henry, N., Pietriga, E., Fekete, J.: Topology-aware navigation in large networks. In: CHI 2009: Proceedings of the 27th International Conference on Human Factors in Computing Systems, pp. 2319–2328. ACM, New York (2009)

Purchase, H.C.: Which aesthetic has the greatest effect on human understanding? In: DiBattista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 248–261. Springer, Heidelberg (1997)

Purchase, H.C., Carrington, D., Allder, J.-A.: Experimenting with aesthetics-based graph layout. In: Anderson, M., Cheng, P., Haarslev, V. (eds.) Diagrams 2000. LNCS (LNAI), vol. 1889, pp. 498–501. Springer, Heidelberg (2000)

Purchase, H.C., Hamer, J., Nöllenburg, M., Kobourov, S.G.: On the usability of lombardi graph drawings. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 451–462. Springer, Heidelberg (2013)

Ware, C., Purchase, H., Colpoys, L., McGill, M.: Cognitive measurements of graph aesthetics. Information Visualization 1(2), 103–110 (2002)