An algorithm for drawing general undirected graphs
Information Processing Letters
Graph drawing by force-directed placement
Software—Practice & Experience
Drawing graphs nicely using simulated annealing
ACM Transactions on Graphics (TOG)
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Three dimensional UML using force directed layout
APVis '01 Proceedings of the 2001 Asia-Pacific symposium on Information visualisation - Volume 9
Building virtual worlds with the big-bang model
APVis '01 Proceedings of the 2001 Asia-Pacific symposium on Information visualisation - Volume 9
A multi-dimensional approach to force-directed layouts of large graphs
Computational Geometry: Theory and Applications - Special issue on the 10th fall workshop on computational geometry
| Hi-index | 0.00 |
This paper describes a novel force-directed placement approach for 3D drawing of large graphs. The main idea behind our approach consists in optimizing the layout by equitably distributing vertices in the space. We consider the largest sphere inscribed in the 3D space and the vertices are then assigned random initial positions that are improved by force-directed placement. In order to ensure the effectiveness of the algorithm, we propose a new energy function minimization which uses the conjugated gradient of Fletcher-Reeves [1, 2]. Our algorithm is not only addressed to general undirected graphs but also it produces good layout of large trees. This work is motivated by our need to offer 3D visualization tools for large computing networks but this first phase will be focused on the graph representation.