Graph layouts can be computed by a compact neural field trained on the layout energy, enabling out-of-sample node placement, sub-quadratic pair handling, and a family of drawings from one fit.
Graph drawing by force-directed placement
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.HC 1years
2026 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Inductive Graph Layout with Implicit Neural Fields
Graph layouts can be computed by a compact neural field trained on the layout energy, enabling out-of-sample node placement, sub-quadratic pair handling, and a family of drawings from one fit.