Graph drawing by force-directed placement
Software—Practice & Experience
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
IEEE Transactions on Visualization and Computer Graphics
Separating Thickness from Geometric Thickness
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data
IEEE Transactions on Visualization and Computer Graphics
Geometry-Based Edge Clustering for Graph Visualization
IEEE Transactions on Visualization and Computer Graphics
Colored Simultaneous Geometric Embeddings and Universal Pointsets
Algorithmica - Special issue: Algorithms, Combinatorics, & Geometry
Using the Gestalt Principle of Closure to Alleviate the Edge Crossing Problem in Graph Drawings
IV '11 Proceedings of the 2011 15th International Conference on Information Visualisation
Train tracks and confluent drawings
GD'04 Proceedings of the 12th international conference on Graph Drawing
Evaluating partially drawn links for directed graph edges
GD'11 Proceedings of the 19th international conference on Graph Drawing
SideKnot: Revealing relation patterns for graph visualization
PACIFICVIS '12 Proceedings of the 2012 IEEE Pacific Visualization Symposium
Progress on partial edge drawings
GD'12 Proceedings of the 20th international conference on Graph Drawing
| Hi-index | 0.00 |
One of the main principles for the effective visualization of graphs is the avoidance of edge crossings. Around this problem, very active research has been performed with works ranging from combinatorics, to algorithmics, visualization effects, to psychological user studies. Recently, the pragmatic approach has been proposed to avoid crossings by drawing the edges only partially. Unfortunately, no formal model and efficient algorithms have been formulated to this end. We introduce the concept for drawings of graphs with partially drawn edges (PED). Therefore we consider graphs with and without given embedding and characterize PEDs with concepts like symmetry and homogeneity. For graphs without embedding we formulate a sufficient condition to guarantee a symmetric homogeneous PED, and identify a nontrivial graph class which has a symmetric homogeneous PED. For graphs with given layout we consider the variants of maximizing the shortest partially drawn edge and the total length respectively.