Choosing colors for geometric graphs via color space embeddings

Authors:
Michael B. Dillencourt;David Eppstein;Michael T. Goodrich
Affiliations:
Dept. of Computer Science, Univ. of California, Irvine, CA;Dept. of Computer Science, Univ. of California, Irvine, CA;Dept. of Computer Science, Univ. of California, Irvine, CA
Venue:
GD'06 Proceedings of the 14th international conference on Graph drawing
Year:
2006

Citing 14
Cited 1

The visual display of quantitative information

The visual display of quantitative information
Envisioning information

Envisioning information
A tool for dynamic explorations of color mappings

I3D '90 Proceedings of the 1990 symposium on Interactive 3D graphics
Choosing effective colours for data visualization

Proceedings of the 7th conference on Visualization '96
Hamiltonicity and colorings of arrangement graphs

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Drawing graphs: methods and models

Drawing graphs: methods and models
Automatic data and computation decomposition on distributed memory parallel computers

ACM Transactions on Programming Languages and Systems (TOPLAS)
Empirical evaluation of dissimilarity measures for color and texture

Computer Vision and Image Understanding - Special issue on empirical evaluation of computer vision algorithms
Color Sequences for Univariate Maps: Theory, Experiments and Principles

IEEE Computer Graphics and Applications
Visualizing Color Gamuts: A User Interface for the Effective Use of Perceptual Color Spaces in Data Displays

IEEE Computer Graphics and Applications
Color Scales for Image Data

IEEE Computer Graphics and Applications
Graph Drawing Software

Graph Drawing Software
Testing bipartiteness of geometric intersection graphs

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Distributed parallel computing using navigational programming

International Journal of Parallel Programming

On maximum differential graph coloring

GD'10 Proceedings of the 18th international conference on Graph drawing

Quantified Score

Hi-index	0.01

Visualization

Abstract

Graph drawing research traditionally focuses on producing geometric embeddings of graphs satisfying various aesthetic constraints. After the geometric embedding is specified, there is an additional step that is often overlooked or ignored: assigning display colors to the graph's vertices. We study the additional aesthetic criterion of assigning distinct colors to vertices of a geometric graph so that the colors assigned to adjacent vertices are as different from one another as possible. We formulate this as a problem involving perceptual metrics in color space and we develop algorithms for solving this problem by embedding the graph in color space. We also present an application of this work to a distributed load-balancing visualization problem.