An algorithm for drawing general undirected graphs
Information Processing Letters
NicheWorks - Interactive Visualization of Very Large Graphs
GD '97 Proceedings of the 5th International Symposium 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)
APVis '04 Proceedings of the 2004 Australasian symposium on Information Visualisation - Volume 35
The Binary Stress Model for Graph Drawing
Graph Drawing
An Experimental Study on Distance-Based Graph Drawing
Graph Drawing
Topology Preserving Constrained Graph Layout
Graph Drawing
Graph drawing by stress majorization
GD'04 Proceedings of the 12th international conference on Graph Drawing
Visualization of quasi-median networks
Discrete Applied Mathematics
Planar preprocessing for spring embedders
GD'12 Proceedings of the 20th international conference on Graph Drawing
| Hi-index | 0.00 |
We describe an algorithm for radial layout of undirected graphs, in which nodes are constrained to the circumferences of a set of concentric circles around the origin. Such constraints frequently occur in the layout of social or policy networks, when structural centrality is mapped to geometric centrality, or when the primary intention of the layout is the display of the vicinity of a distinguished node. We extend stress majorization by a weighting scheme which imposes radial constraints on the layout but also tries to preserve as much information about the graph structure as possible.