A proposed method for representing hierarchies
IEEE Transactions on Systems, Man and Cybernetics
DAG—a program that draws directed graphs
Software—Practice & Experience
Journal of Information Processing
Dynamic variable ordering for ordered binary decision diagrams
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Graph layout for applications in compiler construction
Theoretical Computer Science
Introduction to Algorithms
A Technique for Drawing Directed Graphs
IEEE Transactions on Software Engineering
A Fast Heuristic for Hierarchical Manhattan Layout
GD '95 Proceedings of the Symposium on Graph Drawing
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs
GD '96 Proceedings of the Symposium on Graph Drawing
Fast and Simple Horizontal Coordinate Assignment
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Graph Layout through the VCG Tool
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Communicating Centrality in Policy Network Drawings
IEEE Transactions on Visualization and Computer Graphics
Animated Exploration of Dynamic Graphs with Radial Layout
INFOVIS '01 Proceedings of the IEEE Symposium on Information Visualization 2001 (INFOVIS'01)
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
INFOVIS'03 Proceedings of the Ninth annual IEEE conference on Information visualization
Radial coordinate assignment for level graphs
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Crossing reduction in circular layouts
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Network patterns: designing effective user interfaces for connections management at work
Proceedings of the 2008 ACM conference on Computer supported cooperative work
Group-Level Analysis and Visualization of Social Networks
Algorithmics of Large and Complex Networks
Crossing minimization in extended level drawings of graphs
Discrete Applied Mathematics
Multi-circular layout of micro/macro graphs
GD'07 Proceedings of the 15th international conference on Graph drawing
Approximating crossing minimization in radial layouts
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Journal of Visual Languages and Computing
Ranking and drawing in subexponential time
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
A global k-level crossing reduction algorithm
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Optimizing a radial layout of bipartite graphs for a tool visualizing security alerts
GD'11 Proceedings of the 19th international conference on Graph Drawing
Classification of planar upward embedding
GD'11 Proceedings of the 19th international conference on Graph Drawing
The duals of upward planar graphs on cylinders
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
On the curve complexity of upward planar drawings
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Upward planar drawings on the standing and the rolling cylinders
Computational Geometry: Theory and Applications
Hi-index | 0.00 |
In radial drawings of hierarchical graphs, the vertices are placed on concentric circles rather than on horizontal lines and the edges are drawn as outward monotone segments of spirals rather than straight lines as it is done in the standard Sugiyama framework. This drawing style is well suited for the visualization of centrality in social networks and similar concepts. Radial drawings also allow a more flexible edge routing than horizontal drawings, as edges can be routed around the center in two directions. In experimental results, this reduces the number of crossings by approximately 30 percent on average. Few crossings are one of the major criteria for human readability. This paper is a detailed description of a complete framework for visualizing hierarchical information in a new radial fashion. Particularly, we briefly cover extensions of the level assignment step to benefit from the increasing perimeters of the circles, present three heuristics for crossing reduction in radial level drawings, and also show how to visualize the results.