Area requirement and symmetry display of planar upward drawings
Discrete & Computational Geometry
An experimental study of the basis for graph drawing algorithms
Journal of Experimental Algorithmics (JEA)
Algorithms for area-efficient orthogonal drawings
Computational Geometry: Theory and Applications - Special issue on geometric representations of graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Which Aesthetic has the Greatest Effect on Human Understanding?
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
A Comparison of the Readability of Graphs Using Node-Link and Matrix-Based Representations
INFOVIS '04 Proceedings of the IEEE Symposium on Information Visualization
On the visualization of large-sized ontologies
Proceedings of the working conference on Advanced visual interfaces
MatrixExplorer: a Dual-Representation System to Explore Social Networks
IEEE Transactions on Visualization and Computer Graphics
Algorithms for computing a parameterized st-orientation
Theoretical Computer Science
A Comparison of User-Generated and Automatic Graph Layouts
IEEE Transactions on Visualization and Computer Graphics
Orthogonal drawings of graphs with vertex and edge labels
Computational Geometry: Theory and Applications
New improvements in optimal rectangle packing
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
How important is the "Mental map"?: an empirical investigation of a dynamic graph layout algorithm
GD'06 Proceedings of the 14th international conference on Graph drawing
MatLink: enhanced matrix visualization for analyzing social networks
INTERACT'07 Proceedings of the 11th IFIP TC 13 international conference on Human-computer interaction - Volume Part II
Visual Analysis of Large Graphs Using (X,Y)-Clustering and Hybrid Visualizations
IEEE Transactions on Visualization and Computer Graphics
Graph Drawing Aesthetics—Created by Users, Not Algorithms
IEEE Transactions on Visualization and Computer Graphics
Overloaded orthogonal drawings
GD'11 Proceedings of the 19th international conference on Graph Drawing
| Hi-index | 0.00 |
In this paper, we propose a novel visualization framework called DAGView. The aim of DAGView is to produce clear visualizations of directed acyclic graphs in which every edge and the potential existence of a path can be immediately spotted by the user. Several criteria that users identified as important in a layout are met, such as underlying grid, crossings and bends that appear perpendicular. The main algorithm is based on the layout of directed acyclic graphs but can be extended to handle directed graphs with cycles and undirected graphs, taking into account user preferences and/or constraints. Important tasks that are used in user studies are performed efficiently within the DAGView framework.