A coloring solution to the edge crossing problem

Proceedings of the International Conference on Information Visualisation

Volumn , Issue , 2009, Pages 691-696

  Jianu, Radu ^a   Rusu, Adrian ^b   Fabian, Andrew J ^b   Laidlaw, David H ^a  

^a Brown Univerity   (United States)

^b Rowan University   (United States)

Author keywords

Color embeddings; Colors; Graphs

Indexed keywords

ANECDOTAL EVIDENCES; DISTANCE METRICS; EDGE CROSSING; GRAPH DRAWING; GRAPH EDGES; GRAPHS;

COLOR; COLORING; CROSSINGS (PIPE AND CABLE); VISUALIZATION;

GRAPH THEORY;

EID: 70449505747     PISSN: 10939547     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IV.2009.66     Document Type: Conference Paper

References (25)

1. M.W. Bern, D. Eppstein, and B. Hutchings. Algorithms for coloring quadtrees. Algorithmica, Volume 32, Issue 1, pages 87-94, 2002.
2. M. Chalmers. A linear iteration time layout algorithm forvisualizing high-dimensional data. In Proc. of VIS'96, pages 127-ff. IEEE CS Press, 1996.
3. C. Demiralp, S. Zang, D. Tate, S. Correia and D. H. Laidlaw. Connectivity-aware sectional visualization of 3D DTI volumes using perceptual flat-torus coloring and edge rendering. In Proceedings of Eurographics, 2006.
4. M.B. Dillencourt, D. Epstein and M. T. Goodrich. Choosing colors for geometric graphs via color space embeddings. In Proceedings of the 14th International Symposium on Graph Drawing, pages 294-305, 2006.
5. P. Eades. A Heuristic for Graph Drawing. In Congressus Numerantium, Volume 42, pages 149-160, 1984.
6. D. Eppstein. Testing bipartiteness of geometric intersection graphs. In Proc. 15th Symp. Discrete Algorithms, pages 853-861. ACM and SIAM, 2004.
7. S. Felsner, F. Hurtado, M. Noy, and I. Streinu. Hamiltonicity and colorings of arrangement graphs. In Proc. 11th Symp. Discrete Algorithms, pages 155-164. ACM and SIAM, 2000.
8. H. de Fraysseix, J. Pach, and R. Pollark. How to draw a planar graph on a grid. Combinatorica, Volume 10, pages 41-51, 1990.
9. T. Fruchterman and E. Reingold. Graph Drawing by Force-Directed Placement. In Software-Practice and Experience, Volume 21, Issue 11, pages 1129-1164, 1991.
10. C. Healey. Choosing effective colors for data visualization. In Proceedings of the 7th conference on Visualization, pages 263-ff, 1996.
11. I. Jolliffe. Principal Component Analysis. Springer-Verlag, 1986.
12. T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Information Processing Letters, Volume 31, Issue 1, pages 7-15, 1989.
13. E. Kandogan. Star Coordinates: A multidimensional visualization technique with uniform treatment ofdimensions. In Proceedings of the IEEE Information Visualization Symposium, pages 9-12, 2000. .
14. H. Levkovitz and G. Herman. Color scales for image data. In IEEE Computer Graphics and Applications Volume 12, pages 72-80, 1992.
15. A. Morrison and M. Chalmers. A pivot-based routine for improved parent-finding in hybrid MDS. Information Visualization, Volume 3, Issue 2, pages 109-122, 2004.
16. H. Purchase. Which aesthetic has the greatest effect on human understanding? In Proceedings of the 5th International Symposium on Graph Drawing, pages 248- 261, 1997.
17. P. Rheingans and B. Tebbs. A tool for dynamic explorations of color mappings. Computer Graphics, Volume 24, Issue 2, pages 145-146, 1990.
18. P. Robertson. Visualizing color gamuts: A user interface for the effective use of perceptual color spaces in data displays. IEEE Computer Graphics and Applications, Volume 8, Issue 5, pages 50-64, 1988.
19. J. Sammon. A Nonlinear Mapping for Data Structure Analysis. In IEEE Trans. Computers, Volume 13, pages 401-409, 1964.
20. K. Seisenberger. Termgraph: Ein System zur Zeichnerischen Darstellung von Strukturierten Agenten und Petrinetzen. Diplomarbeit, Universität Passau, 1991.
21. R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM Journal on Computing, Volume 16, pages 421-444, 1987.
22. E. Tejada, R. Minghim, and L.G. Nonato. On improved projection techniques to support visual exploration of multidimensional data sets. Information Visualization, Volume 2, Issue 4, pages 218-231, 2003.
23. D. Tunkelang. A practical approach to drawing undirected graphs. Carnegie Mellon University, 1994.
24. C. Ware. Color sequences for univariate maps: Theory, experiments and principles. In IEEE Computer Graphics and Applications, Volume 8, pages 41-49, 1988.
25. D. Woods. Drawing Planar Graphs. PhD thesis, Stanford University, 1982.