login

A simple and unified method for drawing graphs: Magnetic-spring algorithm

Lecture notes in computer sciencePublished 1 January 1995Open access
Kozo Sugiyama, Kazuo Misue
Citations59
SJR quartileQ2
SJR score0.35
SNIP0.55
View PDF

TL;DR

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.

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 end improve it. Examples of layouts and results of experiments are shown to demonstrate extensive possibilities of the method.

Keywords

Computer ScienceSocial Sciences