Paper Info
Title
A Simple and Unified Method for Drawing Graphs: Magnetic-Spring Algorithm
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.
Year
Venue
Keywords
1994
Lecture Notes in Computer Science
drawing graphs,unified method,magnetic-spring algorithm
Field
DocType
ISBN
Graph,Combinatorics,Heuristic,Computer science,Algorithm,Theoretical computer science,Mixed graph
Conference
3-540-58950-3
Citations 
PageRank 
References 
29
2.87
5
Authors
2
Name
Order
Citations
PageRank
Kozo Sugiyama11011142.82
Kazuo Misue254059.88