Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/IV.2009.66 | Barcelona |
Keywords | Field | DocType |
data visualisation,graph colouring,anecdotal evidence,edge crossing problem,graph drawing,graph edges coloring,graph visualization,color embeddings,colors,graphs | Complete coloring,Edge coloring,Discrete mathematics,Combinatorics,Multigraph,Fractional coloring,Mixed graph,Multiple edges,Mathematics,Topological graph,Graph coloring | Conference |
ISSN | ISBN | Citations |
1550-6037 | 978-0-7695-3733-7 | 6 |
PageRank | References | Authors |
0.53 | 19 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Radu Jianu | 1 | 126 | 9.90 |
| Adrian Rusu | 2 | 82 | 10.65 |
| Andrew J. Fabian | 3 | 19 | 1.90 |
| Laidlaw, D.H. | 4 | 38 | 4.01 |