Spring Embedders and Force Directed Graph Drawing Algorithms

Details Spring Embedders and Force Directed Graph Drawing Algorithms Spring Embedders and Force Directed Graph Drawing Algorithms

2012-01-14

arxiv.org/abs/1201.3011v1

Computer Science

Computational Geometry

23 pages, 8 figures

Scientific paper

Force-directed algorithms are among the most flexible methods for calculating layouts of simple undirected graphs. Also known as spring embedders, such algorithms calculate the layout of a graph using only information contained within the structure of the graph itself, rather than relying on domain-specific knowledge. Graphs drawn with these algorithms tend to be aesthetically pleasing, exhibit symmetries, and tend to produce crossing-free layouts for planar graphs. In this survey we consider several classical algorithms, starting from Tutte's 1963 barycentric method, and including recent scalable multiscale methods for large and dynamic graphs.

Affiliated with

Also associated with

No associations

Rating

Spring Embedders and Force Directed Graph Drawing Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Spring Embedders and Force Directed Graph Drawing Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Spring Embedders and Force Directed Graph Drawing Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-693995