A Coloring Algorithm for Disambiguating Graph and Map Drawings

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 di...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on visualization and computer graphics. - 1996. - 25(2019), 2 vom: 29. Feb., Seite 1321-1335
1. Verfasser: Hu, Yifan (VerfasserIn)
Weitere Verfasser: Shi, Lei, Liu, Qingsong
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2019
Zugriff auf das übergeordnete Werk:IEEE transactions on visualization and computer graphics
Schlagworte:Journal Article
LEADER 01000naa a22002652 4500
001 NLM286368978
003 DE-627
005 20231225051540.0
007 cr uuu---uuuuu
008 231225s2019 xx |||||o 00| ||eng c
024 7 |a 10.1109/TVCG.2018.2798631  |2 doi 
028 5 2 |a pubmed24n0954.xml 
035 |a (DE-627)NLM286368978 
035 |a (NLM)29994354 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Hu, Yifan  |e verfasserin  |4 aut 
245 1 2 |a A Coloring Algorithm for Disambiguating Graph and Map Drawings 
264 1 |c 2019 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Revised 20.11.2019 
500 |a published: Print-Electronic 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a 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 give examples demonstrating this approach in real world graphs and maps, as well as a user study to establish its effectiveness and limitations 
650 4 |a Journal Article 
700 1 |a Shi, Lei  |e verfasserin  |4 aut 
700 1 |a Liu, Qingsong  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on visualization and computer graphics  |d 1996  |g 25(2019), 2 vom: 29. Feb., Seite 1321-1335  |w (DE-627)NLM098269445  |x 1941-0506  |7 nnns 
773 1 8 |g volume:25  |g year:2019  |g number:2  |g day:29  |g month:02  |g pages:1321-1335 
856 4 0 |u http://dx.doi.org/10.1109/TVCG.2018.2798631  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 25  |j 2019  |e 2  |b 29  |c 02  |h 1321-1335