Abstract
A simple and unified heuristic method for nicely drawing directed, undirected and mixed graphs is proposed basing upon a new model called magnetic-spring model which is an extension of Eades’s spring model. In the new model, the idea of controlling edge orientations by magnetic forces is employed. Since the method is conceptually intuitive, it is quite easy to understand, implement, tune and improve it. Examples of layouts and results of experiments are shown to demonstrate extensive possibilities of the method.
Cite
CITATION STYLE
Sugiyama, K., & Misue, K. (1995). A simple and unified method for drawing graphs: Magnetic-spring algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 894, pp. 364–375). Springer Verlag. https://doi.org/10.1007/3-540-58950-3_391
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
