Related papers: Connected perimeter of planar sets
We consider a general metric Steiner problem which is of finding a set $\mathcal{S}$ with minimal length such that $\mathcal{S} \cup A$ is connected, where $A$ is a given compact subset of a given complete metric space $X$; a solution is…
In this paper we provide an approximation \`a la Ambrosio-Tortorelli of some classical minimization problems involving the length of an unknown one-dimensional set, with an additional connectedness constraint, in dimension two. We introduce…
A connected covering is a design system in which the corresponding {\em block graph} is connected. The minimum size of such coverings are called {\em connected coverings numbers}. In this paper, we present various formulas and bounds for…
We consider the problem of assigning radii to a given set of points in the plane, such that the resulting set of circles is connected, and the sum of radii is minimized. We show that the problem is polynomially solvable if a connectivity…
We consider a version of Gamow's liquid drop model with a short range attractive perimeter-penalizing potential and a long-range Coulomb interaction of a uniformly charged mass in $\R^3$. Here we constrain ourselves to minimizing among the…
Via multilinear algebra, we formulate a criterion for connectedness in the parametric geometry of numbers in terms of pencils, which are certain algebraic varieties in the space of matrices. As a consequence, we obtain a connectedness…
In this paper we define a notion of calibration for an equivalent approach to the classical Steiner problem in a covering space setting and we give some explicit examples. Moreover we introduce the notion of calibration in families: the…
The Steiner tree problem can be stated in terms of finding a connected set of minimal length containing a given set of finitely many points. We show how to formulate it as a mass-minimization problem for $1$-dimensional currents with…
We describe non-locally connected planar continua via the concepts of fiber and numerical scale. Given a continuum $X\subset\mathbb{C}$ and $x\in\partial X$, we show that the set of points $y\in \partial X$ that cannot be separated from $x$…
In this paper we consider variational problems involving 1-dimensional connected sets in the Euclidean plane, such as the classical Steiner tree problem and the irrigation (Gilbert-Steiner) problem. We relate them to optimal partition…
Characterization results for equality cases and for rigidity of equality cases in Steiner's perimeter inequality are presented. (By rigidity, we mean the situation when all equality cases are vertical translations of the Steiner's symmetral…
In this work, I collect and discuss a series of open questions in one-dimensional geometric optimization in Euclidean spaces. The focus is on two classes of problems: maximal distance minimizers and Steiner trees. Maximal distance…
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…
We show that any compact connected semialgebraic set is the projection of a connected component of the configuration space of a linkage.
The Steiner distance of vertices in a set $S$ is the minimum size of a connected subgraph that contain these vertices. The sum of the Steiner distances over all sets $S$ of cardinality $k$ is called the Steiner $k$-Wiener index and studied…
We investigate the descriptional complexity of operations on semilinear sets. Roughly speaking, a semilinear set is the finite union of linear sets, which are built by constant and period vectors. The interesting parameters of a semilinear…
It is shown that each finite family of finite metric spaces, being considered as a subset of Gromov--Hausdorff space, can be connected by a Steiner minimal tree.
We study local connectedness, local accessibility and finite connectedness at the boundary, in relation to the compactness of the Mazurkiewicz completion of a bounded domain in a metric space. For countably connected planar domains we…
We analyze correlation functions in a toy model of a random geometry interacting with matter. We show that in general the connected correlator will contain a long-range scaling part which is in some sense a remnant of the disconnected part.…
A planar stuffed map is an embedding of a graph into the 2-sphere $S^{2}$, considered up to orientation-preserving homeomorphisms, such that the complement of the graph is a collection of disjoint topologically connected components that are…