A Fast Adaptive Layout Algorithm for Undirected Graphs

By Arne Frick, Andreas H. Ludwig, Heiko Mehldau. 1994

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

ForceAtlas2, a Continuous Graph Layout Algorithm for Handy Network Visualization Designed for the Gephi Software (2014, methodology): “GUESS was the most adapted to our needs, being user-centric and implementing state-of-the-art spatialization algorithms such as GEM [5].”
Spring Embedders and Force Directed Graph Drawing Algorithms (2012, background): “Yet, renewed interest in force-directed graph layout algorithms brought forth many new ideas in the 1990’s. Frick et al. [29] add new heuristics to the Fruchterman-Reingold approach.”
Metrics for Graph Drawing Aesthetics (2002, methodology): “* GEM (spring): based on the algorithm by Frick [8],”
Energy Models for Graph Clustering (2007, unknown): “This can be avoided by adding a gravitational energy that attracts each node to the barycenter of the layout [19].”
Graph Visualization and Navigation in Information Visualization: A Survey (2000, methodology): “This makes them less interesting for information visualization since unpredictability can be a major problem for interaction.”
Tulip - A Huge Graph Visualization Framework (2004, methodology): “Other algorithms such as the so called GEM algorithm of Frick et al. [ 14 ], the well-known Tutte algorithm [31] and the Tree map algorithm [7] are also available in Tulip.”
Geometry-Based Edge Clustering for Graph Visualization (2008, background): “According to different aesthetic criteria or specific requirements, appropriate energy models [4, 8, 20, 17] can be formulated.”