Related papers: Skeletal Cut Loci on Convex Polyhedra
The Euclidean Steiner Minimal Tree problem takes as input a set $\mathcal P$ of points in the Euclidean plane and finds the minimum length network interconnecting all the points of $\mathcal P$. In this paper, in continuation to the works…
We introduce and investigate the class of skeletally Dugundji spaces as a skeletal analogue of Dugundji space. The main result states that the following conditions are equivalent for a given space $X$: (i) $X$ is skeletally Dugundji; (ii)…
The lattice size $\operatorname{ls}_{\Delta}(P)$ of a lattice polygon $P$ with respect to the standard simplex $\Delta$ was introduced and studied by Castryck and Cools in the context of simplification of the defining equation of an…
The type A_n full root polytope is the convex hull in R^{n+1} of the origin and the points e_i-e_j for 1<= i<j <= n+1. Given a tree T on the vertex set [n+1], the associated root polytope P(T) is the intersection of the full root polytope…
Let $H$ be a group acting on a simply-connected diagrammatically reducible combinatorial 2-complex $X$ with fine 1-skeleton. If the fixed point set $X^ H$ is non-empty, then it is contractible. Having fine 1-skeleton is a weaker version of…
We give a partial description of the (s,t)-p-path polytope of a directed graph D which is the convex hull of the incidence vectors of simple directed (s,t)-paths in D of length p. First, we point out how the (s,t)-p-path polytope is located…
Given a nonempty set $\mathcal{L}$ of linear orders, we say that the linear order $L$ is $\mathcal{L}$-convex embeddable into the linear order $L'$ if it is possible to partition $L$ into convex sets indexed by some element of $\mathcal{L}$…
Cut-diagrams are diagrammatic objects, defined in dimensions 1 and 2, that generalize links in 3-space and surface-links in 4-space; in dimension 1, this coincides with the theory of welded links. Using cut-diagrams, we introduce an…
The straight skeleton of a polygon is the geometric graph obtained by tracing the vertices during a mitered offsetting process. It is known that the straight skeleton of a simple polygon is a tree, and one can naturally derive directions on…
From the point of view of optimization, a critical issue is relating the combinatorial diameter of a polyhedron to its number of facets $f$ and dimension $d$. In the seminal paper of Klee and Walkup [KW67], the Hirsch conjecture of an upper…
The perfect matching polytope, i.e. the convex hull of (incidence vectors of) perfect matchings of a graph is used in many combinatorial algorithms. Kotzig, Lov\'asz and Plummer developed a decomposition theory for graphs with perfect…
For a subspace arrangement over a finite field we study the evaluation code defined on the arrangement's set of points. The length of this code is given by the subspace arrangement's characteristic polynomial. For coordinate subspace…
Given a set of radii measured from a fixed point, the existence of a convex configuration with respect to the set of distinct radii in the two-dimensional case is proved when radii are distinct or repeated at most four points. However, we…
The farthest point map sends a point in a compact metric space to the set of points farthest from it. We focus on the case when this metric space is a convex centrally symmetric polyhedron, so that we can compose the farthest point map with…
We study the problem of partitioning a given simple polygon $P$ into a minimum number of connected polygonal pieces, each of bounded size. We describe a general technique for constructing such partitions that works for several notions of…
Motivated by an indecomposability criterion of Xun Lin for the bounded derived category of coherent sheaves on a smooth projective variety $X$, we study the paracanonical base locus of $X$, that is the intersection of the base loci of…
A shape of a combinatorial polytope is a convex embedding into Euclidean space. We provide necessary and sufficient conditions for a piecewise linear map between two shapes of the same polytope to be a compression (respectively a weak…
This article deals with 2d almost Riemannian structures, which are generalized Riemannian structures on manifolds of dimension 2. Such sub-Riemannian structures can be locally defined by a pair of vector fields (X,Y), playing the role of…
A cubic polyhedron is a polyhedral surface whose edges are exactly all the edges of the cubic lattice. Every such polyhedron is a discrete minimal surface, and it appears that many (but not all) of them can be relaxed to smooth minimal…
Let X and Y be finite dimensional normed spaces, F(X,Y) a collection of all mappings from X into Y. A mapping $P\in F(X,Y)$ is said to be piecewise affine if there exists a finite family of convex polyhedral subsets covering X and such that…