On embedding a graph in the grid with the minimum number of bends
SIAM Journal on Computing
An experimental comparison of four graph drawing algorithms
Computational Geometry: Theory and Applications
Computing Orthogonal Drawings with the Minimum Number of Bends
IEEE Transactions on Computers
Empirical Evaluation of Aesthetics-based Graph Layout
Empirical Software Engineering
Drawing High Degree Graphs with Low Bend Numbers
GD '95 Proceedings of the Symposium on Graph Drawing
A New Minimum Cost Flow Algorithm with Applications to Graph Drawing
GD '96 Proceedings of the Symposium on Graph Drawing
Which Aesthetic has the Greatest Effect on Human Understanding?
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Cognitive measurements of graph aesthetics
Information Visualization
Exploration of Networks using overview+detail with Constraint-based cooperative layout
IEEE Transactions on Visualization and Computer Graphics
Topology Preserving Constrained Graph Layout
Graph Drawing
Drawing large graphs with a potential-field-based multilevel algorithm
GD'04 Proceedings of the 12th international conference on Graph Drawing
Curvilinear graph drawing using the force-directed method
GD'04 Proceedings of the 12th international conference on Graph Drawing
How to visualize the k-root name server (demo)
GD'11 Proceedings of the 19th international conference on Graph Drawing
Evaluating force-directed algorithms with a new framework
Proceedings of the 27th Annual ACM Symposium on Applied Computing
An aggregation-based approach to quality evaluation of graph drawings
Proceedings of the 5th International Symposium on Visual Information Communication and Interaction
ImPrEd: an improved force-directed algorithm that prevents nodes from crossing edges
EuroVis'11 Proceedings of the 13th Eurographics / IEEE - VGTC conference on Visualization
Planar preprocessing for spring embedders
GD'12 Proceedings of the 20th international conference on Graph Drawing
| Hi-index | 0.00 |
This paper studies the problem of designing graph drawing algorithms that guarantee good trade-offs in terms of number of edge crossings, crossing angle resolution, and geodesic edge tendency. It describes two heuristics designed within the topology-driven force-directed framework that combines two classical graph drawing approaches: the force-directed approach and a planarization-based approach (e.g., the topology-shape-metrics approach). An extensive experimental analysis on two different test suites of graphs shows the effectiveness of the proposed solutions for the optimization of some readability metrics.