Work

Periodic Steiner networks minimizing length

Year: 2017
Type: preprint
Abstract: We study a problem of geometric graph theory: We determine the triply periodic graph in Euclidean 3-space which minimizes length among all graphs spanning a fundamental domain of 3-space with the same volume. The minimizer is the so-called srs network with quotient the complete graph on four vertices $K_4$. The network spans the body centred cubic lattice and is related to the gyroid triply periodic surface.
Language: English
Open Access status: green
OpenAlex ID: W4387450866
Cites:
Cited by: 1
Related to: 10