2009 · 18 citations · 18 references
ComputingVisualizationColor TheoryData VisualizationGraph VisualizationColor ModelsColor RepresentationColor Space RepresentationGraph ColoringGraph DrawingGraph TheoryAnecdotal EvidenceCrossing MinimizationEdge ColoringEdge Crossings ReductionEdge-crossing ReductionEmbedding TechniquesVertex Coloring
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.
18
Colin Goodall, Ian T. Jolliffe · Technometrics · 1988 · 8.7K citations
A Nonlinear Mapping for Data Structure Analysis
John W. Sammon · IEEE Transactions on Computers · 1969 · 3.4K citations
An algorithm for drawing general undirected graphs
Tomihisa Kamada, Satoru Kawai · Information Processing Letters · 1989 · 2.8K citations
P. Eades · 1984 · 1.2K citations