Adaptive Node Positioning in Biological Transport Networks
Albert Alonso, Lars Erik J. Skjegstad, Julius B. Kirkegaard

TL;DR
This paper introduces a generalized hydrodynamic graph model that optimizes both node positions and edge widths, leading to more efficient and realistic biological transport networks, with insights into their formation and phase transitions.
Contribution
It extends existing models by allowing node position optimization using differentiable physics, improving the realism and efficiency of simulated biological networks.
Findings
Organic networks adapt to boundary irregularities and node misalignments.
A phase transition occurs where networks collapse below a critical conductivity threshold.
The model provides insights into early biological system formation.
Abstract
Biological transport networks are highly optimized structures that ensure power-efficient distribution of fluids across various domains, including animal vasculature and plant venation. Theoretically, these networks can be described as space-embedded graphs, and rich structures that align well with observations emerge from optimizing their hydrodynamic energy dissipation. Studies on these models typically use regular grids and focus solely on edge width optimization. Here, we present a generalization of the hydrodynamic graph model which permits additional optimization of node positioning. We achieve this by defining sink regions, accounting for the energy dissipation of delivery within these areas, and optimizing by means of differentiable physics. In the context of leaf venation patterns, our method results in organic networks that adapt to irregularities of boundaries and node…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDNA and Biological Computing
