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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 894, Issue , 1995, Pages 364-375

  Sugiyama, Kozo ^a   Misue, Kazuo ^a  

^a FUJITSU LABORATORIES LTD   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DIRECTED GRAPHS; DRAWING (GRAPHICS); MAGNETISM;

EDGE ORIENTATIONS; MAGNETIC FORCE; MAGNETIC SPRING; MIXED GRAPH; SPRING MODEL; UNIFIED METHOD;

HEURISTIC METHODS;

EID: 84957578504     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58950-3_391     Document Type: Conference Paper

References (9)

1. 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).
2. P. Eades: A heuristic for graph drawing, Congressus Numerantium 42, 149-160, (1984).
3. T. Kamada: On visualization of abstract objects and relations, Dr. S. thesis, Univ. of Tokyo, (1988).
4. T. Fruchterman and E. Reingold: Graph drawing by force-directed placement, Software-Practice and Experience 21(11), 1129-1164, (1991).
5. M. J. Bickerton: A practitioner's handbook of requirement engineering methods and tools, Oxford Univ., (1992).
6. 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).
7. 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).
8. P. Creszenzi, G. Di Battista and A. Pipemo: A note on optimal area algorithms for upward drawings of binary trees, J. Computational Geometry, 2(4), 187-200, (1992).
9. M. G. Reggiani and F. E. Marchetti: A proposed method for representing hierarchies, IEEE Trans. Systems, Man, and Cybernetics SMC-18(1), 2-8, (1988).