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. © 2011 Springer-Verlag.
CITATION STYLE
Didimo, W., Liotta, G., & Romeo, S. A. (2011). Topology-driven force-directed algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6502 LNCS, pp. 165–176). https://doi.org/10.1007/978-3-642-18469-7_15
Mendeley helps you to discover research relevant for your work.