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 , 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
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1424

Actions (login required)

View Item View Item