Initial Placement for Fruchterman--Reingold Force Model With Coordinate Newton Direction

The Fruchterman--Reingold (FR) force model is widely used in force-directed graph drawing, and multilevel approaches such as sfdp in Graphviz scale these methods effectively. A crucial step in multilevel schemes is refinement, which improves the graph layout typically performed with the FR algorithm. For this refinement, optimization-based methods, such as L-BFGS, often yield better layouts by exploiting past gradient information. However, they suffer from high per-iteration costs for large graphs and difficulty in handling highly twisted graphs. In this research, we propose a new initial placement based on the stochastic coordinate descent to accelerate the optimization process. We first reformulate the problem as a discrete optimization problem using a hexagonal lattice and then iteratively update a randomly selected vertex along the coordinate Newton direction with low per-iteration costs. We demonstrate the effectiveness of our method through numerical experiments, showing that our initial placement leads to faster convergence and higher-quality layouts compared to naive optimization approaches. We also discuss how the coordinate Newton direction can be applied to other graph-related problems from an optimization perspective.

Authors

Institutions

Publication Details

Journal
Journal of Graph Algorithms and Applications
Published
2026-11-02
DOI
https://doi.org/10.7155/jgaa.v30i1.3113
Citations
1
Primary Topic
Data Visualization and Analytics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Initial Placement for Fruchterman--Reingold Force Model With Coordinate Newton Direction

Naoki Marumo, Akiko Takeda
1 citations
Journal of Graph Algorithms and Applications
Data Visualization and Analytics
article

Initial Placement for Fruchterman--Reingold Force Model With Coordinate Newton Direction

Naoki Marumo, Akiko Takeda
article en
1 citations

Abstract

The Fruchterman--Reingold (FR) force model is widely used in force-directed graph drawing, and multilevel approaches such as sfdp in Graphviz scale these methods effectively. A crucial step in multilevel schemes is refinement, which improves the graph layout typically performed with the FR algorithm. For this refinement, optimization-based methods, such as L-BFGS, often yield better layouts by exploiting past gradient information. However, they suffer from high per-iteration costs for large graphs and difficulty in handling highly twisted graphs. In this research, we propose a new initial placement based on the stochastic coordinate descent to accelerate the optimization process. We first reformulate the problem as a discrete optimization problem using a hexagonal lattice and then iteratively update a randomly selected vertex along the coordinate Newton direction with low per-iteration costs. We demonstrate the effectiveness of our method through numerical experiments, showing that our initial placement leads to faster convergence and higher-quality layouts compared to naive optimization approaches. We also discuss how the coordinate Newton direction can be applied to other graph-related problems from an optimization perspective.

Journal of Graph Algorithms and ApplicationsVol. 30(1)
The University of Tokyo (JP)
Openalex Percentile: Top 100%
Data Visualization and Analytics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
Initial Placement for Fruchterman--Reingold Force Model With Coordinate Newton Direction — Naoki Marumo, Akiko Takeda · Journal of Graph Algorithms and Applications (2026) | TGRS Research Map | TGRS