vix.ing · top · new · best · stats

Graph drawing by force‐directed placement

1991/11/01 by Thomas M. J. Fruchterman, Edward M. Reingold · 6,404 citations
Computer Science · Mathematics · #Algorithm #Analogy #Artificial intelligence #Computer science #Data Visualization and Analytics #Directed graph #Enhanced Data Rates for GSM Evolution #Graph #Graph drawing #Heuristic #Mathematics #Simple (philosophy) #Software Engineering Research #Theoretical computer science #Topological and Geometric Data Analysis #Undirected graph

paper · doi:10.1002/spe.4380211102

published in Software Practice and Experience 21(11), 1129-1164 (Wiley)

openalex publication_date 1991/11/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/06

Abstract

Abstract We present a modification of the spring‐embedder model of Eades [Congressus Numerantium, 42, 149–160, (1984)] for drawing undirected graphs with straight edges. Our heuristic strives for uniform edge lengths, and we develop it in analogy to forces in natural systems, for a simple, elegant, conceptually‐intuitive, and efficient algorithm.

Cited by

Related