On the Steiner tree connecting a fractal set

arXiv2304.01932MaRDI QIDQ6432067FDOQ6432067

Authors: Emmanuele Paolini, Eugene Stepanov 

Publication date: 4 April 2023

Abstract: We construct an example of an infinite planar embedded self-similar binary tree $Sigma$ which is the essentially unique solution to the Steiner problem of finding the shortest connection of a given planar self-similar fractal set $C$ of positive Hausdorff dimension. The set $C$ can be considered the set of leaves, or the ``boundary``, of the tree $Sigma$, so that $Sigma$ is an irreducible solution to the Steiner problem with datum $C$ (i.e. $SigmasetminusC$ is connected).

Mathematics Subject Classification ID

Variational problems in a geometric measure-theoretic setting (49Q20) Infinite graphs (05C63) Minimal surfaces and optimization (49Q05) Optimization of shapes other than minimal surfaces (49Q10)

This page was built for publication: On the Steiner tree connecting a fractal set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6432067)