A Simple and Unified Method for Drawing Graphs: Magnetic-Spring Algorithm

Sugiyama, Kozo and Misue, Kazuo (1995) A Simple and Unified Method for Drawing Graphs: Magnetic-Spring Algorithm. In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994 , pp. 364-375(Official URL: http://dx.doi.org/10.1007/3-540-58950-3_391).

Full text not available from this repository.

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.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-58950-3_391
Classifications: M Methods > M.400 Force-directed / Energy-based
URI: http://gdea.informatik.uni-koeln.de/id/eprint/221

Actions (login required)

View Item View Item