PofoliaShared via Pofolia

Journal of Graph Algorithms and Applications· 2026Q2

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

Hiroki Hamaguchi, Naoki Marumo, Akiko Takeda

Short summary

A new initial placement method using stochastic coordinate descent accelerates Fruchterman--Reingold graph layout refinement, achieving faster convergence and higher-quality layouts than naive optimization.

AI-generated from the title and abstract; the full text is not read.

Key points

  • Proposes a new initial placement method for the Fruchterman--Reingold force model using stochastic coordinate descent.
  • Reformulates the problem as a discrete optimization on a hexagonal lattice.
  • Iteratively updates vertices along the coordinate Newton direction, reducing per-iteration costs.
  • Demonstrates faster convergence and higher-quality layouts compared to naive optimization approaches in numerical experiments.

AI-generated from the title and abstract; the full text is not read.

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.

The authors' abstract, as published at the source. Journal of Graph Algorithms and Applications, 2026 · DOI ↗

TakeawaysPremium
Ask the paperFree account

Continue with a free account

Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.

Continue free on the web

Sign in with Google or Apple; no card needed. You come back to this paper.

On your phone:

Field: Computer Vision and Pattern Recognition

Computer Vision and Pattern RecognitionComputer Science