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, Princeton, New Jersey, USA , 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
ID Code:221

Repository Staff Only: item control page

References

N. Quinn and M. Breur: A force directed component placement procedure for printed circuit boards, IEEE Trans. Circuits and Systems, CAS-26(6), 377-388, (1979).

P. Eades: A heuristic for graph drawing, Congressus Numerantium 42, 149-160, (1984).

T. Kamada: On visualization of abstract objects and relations, Dr. S. thesis, Univ. of Tokyo, (1988).

T. Fruchterman and E. Reingold: Graph drawing by force-directed placements, Software-Practice and Experience 21(11), 1129-1164, (1991).

M. J. Bickerton: A practitioner's handbook of requirement engineering methods and tools, Oxford Univ., (1992).

K. Sugiyama and K. Misue: Graph Drawing by Magnetic-Spring Model, Res. Rep. ISIS-RR-94-14E, Inst. Social Information Science, Fujitsu Labs. Ltd., 32p., (1994).

P. Eades: Drawing free trees, Res. Rep. IIAS-RR-91-17E, Intern. Inst. for Advanced Study of Social Information Science, Fujitsu Lab. Ltd., 29p., (1991).

P. Crescenzi, G. Di Battista and A. Piperno: A note on optimal area algorithms for upward drawings of binary trees, J. Computational Geometry, 2(4), 187-200, (1992).

M. G. Reggiani and F. E. Marchetti: A proposed method for represenring hierarchies, IEEE Trans. Systems, Man, and Cybernetics SMC-18(1), 2-8, (1988).