Choosing colors for geometric graphs via color space embeddings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4372 LNCS, Issue , 2007, Pages 294-305

  Dillencourt, Michael B ^a   Eppstein, David ^a   Goodrich, Michael T ^a  

^a Irvine   (United States)

Author keywords

Color perception; Color space; Graph coloring; Graph drawing

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; PROBLEM SOLVING; VISUALIZATION;

COLOR PERCEPTION; COLOR SPACE; GRAPH COLORING; GRAPH DRAWING;

GRAPH THEORY;

EID: 38149104787     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70904-6_29     Document Type: Conference Paper

References (23)

1. N. Alon and P. Erdös. Disjoint edges in geometric graphs. Discrete Comput. Geom., 4:287-290, 1989.
2. M. W. Bern, D. Eppstein, and B. Hutchings. Algorithms for coloring quadtrees. Algorithmica, 32(1):87-94, 2002.
3. J. A. Bondy and U. S. R. Murty. Graph Theory with Applications. Macmillan, London, 1976.
4. C. A. Brewer. Color use guidelines for data representation. In Proc. Section on Statistical Graphics, American Statistical Association, pages 55-60, 1999.
5. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Prentice Hall, Upper Saddle River, NJ, 1999.
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. C. G. Healey. Choosing effective colours for data visualization. In R. Yagel and G. M. Nielson, editors, IEEE Visualization '96, pages 263-270, 1996.
9. M. Jünger and P. Mutzel. Graph Drawing Software. Springer, 2003.
10. M. Kaufmann and D. Wagner. Drawing Graphs: Methods and Models, volume 2025 of Lecture Notes in Computer Science. Springer-Verlag, 2001.
11. P. Lee and Z. M. Kedem. Automatic data and computation decomposition on distributed memory parallel computers. ACM Trans. Programming Languages and Systems, 24(1):1-50, 2002.
12. H. Levkowitz and G. T. Herman. Color scales for image data. IEEE Computer Graphics and Applications, 12(1):72-80, 1992.
13. T. Nishizeki. Planar Graph Drawing, volume 12 of LNSC. World Scientific, 2004.
14. L. Pan, M. K. Lai, K. Noguchi, J. J. Huseynov, L. F. Bic, and M. B. Dillencourt. Distributed parallel computing using Navigational Programming. Int. J. Parallel Programming, 32(1):1-37, 2004.
15. L. Pan, J. Xue, M. K. Lai, L. Bic, M. B. Dillencourt, and L. Bic. Toward automatic data distributions for migrating computations. Submitted for publication, 2006.
16. P. Rheingans and B. Tebbs. A tool for dynamic explorations of color mappings. Computer Graphics, 24(2): 145-146, 1990.
17. P. K. Robertson. Visualizing color gamuts: A user interface for the effective use of perceptual color spaces in data displays. IEEE Computer Graphics and Applications, 8(5):50-64, 1988.
18. Y. Rubner, J. Puzicha, C. Tomasi, and J. M. Buhmann. Empirical evaluation of dissimilarity measures for color and texture. Computer Vision and Image Understanding, 84:25-43, 2001.
19. M. Stokes, M. Anderson, S. Chandrasekar, and R. Motta. A Standard Default Color Space for the Internet - sRGB. Available online at http://www.w3.org/pub/ WWW/Graphics/Color/sRGB.html, 1996.
20. M. Stone. A Field Guide to Digital Color. Morgan Kaufmann, 2nd edition, 2003.
21. E. R. Tufte. The Visual Display of Quantative Information. Graphics Press, Cheshire, Connecticut, 1983.
22. E. R. Tufte. Envisioning Information. Graphics Press, Cheshire, Connecticut, 1990.
23. C. Ware. Color sequences for univariate maps: Theory, experiments, and principles. IEEE Computer Graphics and Applications, 8(5):41-49, 1988.