A Coloring Solution to the Edge Crossing Problem

We introduce the concept of coloring close and crossing edges in graph drawings with perceptually opposing colors making them individually more distinguishable and reducing edge-crossing effects. We define a "closeness" metric on edges as a combination of distance, angle and crossing. We use the inverse of this metric to compute a color embedding in the L*a*b* color space and assign "close" edges colors that are perceptually far apart. We present the following results: a distance metric on graph edges, a method of coloring graph edges, and anecdotal evidence that this technique can improve the reading of graph edges.

[1]  John W. Sammon,et al.  A Nonlinear Mapping for Data Structure Analysis , 1969, IEEE Transactions on Computers.

[2]  D. R. Woods.  Drawing planar graphs , 1981 .

[3]  Peter Eades,et al.  A Heuristic for Graph Drawing , 1984 .

[4]  Roberto Tamassia,et al.  On Embedding a Graph in the Grid with the Minimum Number of Bends , 1987, SIAM J. Comput..

[5]  Colin Ware,et al.  Color sequences for univariate maps: theory, experiments and principles , 1988, IEEE Computer Graphics and Applications.

[6]  Philip K. Robertson.  Visualizing color gamuts: a user interface for the effective use of perceptual color spaces in data displays , 1988, IEEE Computer Graphics and Applications.

[7]  Satoru Kawai,et al.  An Algorithm for Drawing General Undirected Graphs , 1989, Inf. Process. Lett..

[8]  Penny Rheingans,et al.  A tool for dynamic explorations of color mappings , 1990, I3D '90.

[9]  János Pach,et al.  How to draw a planar graph on a grid , 1990, Comb..

[10]  Edward M. Reingold,et al.  Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..

[11]  Haim Levkowitz,et al.  Color scales for image data , 1992, IEEE Computer Graphics and Applications.

[12]  Daniel Tunkelang.  A Practical Approach to Drawing Undirected Graphs , 1994 .

[13]  Matthew Chalmers,et al.  A linear iteration time layout algorithm for visualising high-dimensional data , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[14]  Christopher G. Healey,et al.  Choosing effective colours for data visualization , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[15]  Helen C. Purchase,et al.  Which Aesthetic has the Greatest Effect on Human Understanding? , 1997, GD.

[16]  Eser Kandogan.  Star Coordinates: A Multi-dimensional Visualization Technique with Uniform Treatment of Dimensions , 2000 .

[17]  Stefan Felsner,et al.  Hamiltonicity and colorings of arrangement graphs , 2000, SODA '00.

[18]  David Eppstein,et al.  Algorithms for Coloring Quadtrees , 2001, Algorithmica.

[19]  Rosane Minghim,et al.  On Improved Projection Techniques to Support Visual Exploration of Multi-Dimensional Data Sets , 2003, Inf. Vis..

[20]  Rosane Minghim,et al.  On Improved Projection Techniques to Support Visual Exploration of Multi-Dimensional Data Sets , 2003, Inf. Vis..

[21]  David Eppstein,et al.  Testing bipartiteness of geometric intersection graphs , 2003, SODA '04.

[22]  Matthew Chalmers,et al.  A Pivot-Based Routine for Improved Parent-Finding in Hybrid MDS† , 2004, Inf. Vis..

[23]  David H. Laidlaw,et al.  Connectivity-Aware Sectional Visualization of 3D DTI Volumes using Perceptual Flat-Torus Coloring and Edge Rendering , 2006, Eurographics.

[24]  David Eppstein,et al.  Choosing Colors for Geometric Graphs via Color Space Embeddings , 2006, GD.

[25]  Ian T. Jolliffe,et al.  Principal Component Analysis , 2002, International Encyclopedia of Statistical Science.