Related papers: Tight Span of Path Connected Subsets of the Manhat…
We give a simple algorithm for the construction of the tight span of a finite subset of the Manhattan plane.
We describe a data structure, a rectangular complex, that can be used to represent hyperconvex metric spaces that have the same topology (although not necessarily the same distance function) as subsets of the plane. We show how to use this…
V. Turaev defined recently an operation of "Trimming" for pseudo-metric spaces and analysed the tight span of (pseudo-)metric spaces via this process. In this work we investigate the trimming of finite subspaces of the Manhattan plane. We…
Several authors have recently attempted to show that the intersection of three simply connected subcontinua of the plane is simply connected provided it is non-empty and the intersection of each two of the continua is path connected. In…
We prove that a nonempty closed and geodesically convex subset of the $l_{\infty}$ plane $\mathbb{R}^2_{\infty}$ is hyperconvex and we characterize the tight spans of arbitrary subsets of $\mathbb{R}^2_{\infty}$ via this property: Given any…
Let $G = (V, E)$ be an edge-weighted geometric graph such that every edge is horizontal or vertical. The weight of an edge $uv \in E$ is its length. Let $ W_G (u,v)$ denote the length of a shortest path between a pair of vertices $u$ and…
In the bidirected minimum Manhattan network problem, given a set T of n terminals in the plane, we need to construct a network N(T) of minimum total length with the property that the edges of N(T) are axis-parallel and oriented in a such a…
A connected topological space is said to be widely-connected if each of its non-degenerate connected subsets is dense in the entire space. The object of this paper is the construction of widely-connected subsets of the plane. We give a…
We consider minimum-cardinality Manhattan connected sets with arbitrary demands: Given a collection of points $P$ in the plane, together with a subset of pairs of points in $P$ (which we call demands), find a minimum-cardinality superset of…
In typical flat-band models, defined as nearest-neighbor tight-binding models, flat bands are usually pinned to the special energies, such as top or bottom of dispersive bands, or band-crossing points. In this paper, we propose a simple…
We describe a system that lets a designer interactively draw patterns of strokes in the picture plane, then guide the synthesis of similar patterns over new picture regions. Synthesis is based on an initial user-assisted analysis phase in…
We give a sufficient condition in order that $n$ closed connected subsets in the $n$-dimensional real projective space admit a common multitangent hyperplane.
The tight span, or injective envelope, is an elegant and useful construction that takes a metric space and returns the smallest hyperconvex space into which it can be embedded. The concept has stimulated a large body of theory and has…
Deciding whether a family of disjoint line segments in the plane can be linked into a simple polygon (or a simple polygonal chain) by adding segments between their endpoints is NP-hard.
This note is a survey on the topology of hyperplane arrangements. We mainly focus on the relationship between topology and the real structure, such as adjacent relations of chambers and stratifications related to real structures.
Given a set of points in the plane, we want to establish a connection network between these points that consists of several disjoint layers. Motivated by sensor networks, we want that each layer is spanning and plane, and that no edge is…
A hypergraph consists of a set of vertices and a set of subsets of vertices, called hyperedges. In the metro map metaphor, each hyperedge is represented by a path (the metro line) and the union of all these paths is the support graph (metro…
A lamination $\lambda$ is $\epsilon$-thick (with respect to a basepoint $X$), if the Teichm\"uller ray from $X$ in the direction of $\lambda$ stays in the $\epsilon$-thick part. We show that, for surfaces of high enough genus, any two…
Flip graphs of non-crossing configurations in the plane are widely studied objects, e.g., flip graph of triangulations, spanning trees, Hamiltonian cycles, and perfect matchings. Typically, it is an easy exercise to prove connectivity of a…
We show that 4-connected plane triangulations can be redrawn such that edges are represented by straight segments and the vertices are covered by a set of at most $\sqrt{2n}$ lines each of them horizontal or vertical. The same holds for all…