Related papers: Optimally Guarding 2-Reflex Orthogonal Polyhedra b…
In the MINIMUM CONVEX COVER (MCC) problem, we are given a simple polygon $\mathcal P$ and an integer $k$, and the question is if there exist $k$ convex polygons whose union is $\mathcal P$. It is known that MCC is $\mathsf{NP}$-hard…
We study two popular ways to sketch the shortest path distances of an input graph. The first is distance preservers, which are sparse subgraphs that agree with the distances of the original graph on a given set of demand pairs. Prior work…
We prove two results about transforming any convex polyhedron, modeled as a linkage L of its edges. First, if we subdivide each edge of L in half, then L can be continuously flattened into a plane. Second, if L is equilateral and we again…
We consider the problem of creating plane orthogonal drawings of 4-planar graphs (planar graphs with maximum degree 4) with constraints on the number of bends per edge. More precisely, we have a flexibility function assigning to each edge…
In this paper, we study grid-obstacle representations of graphs where we assign grid-points to vertices and define obstacles such that an edge exists if and only if an $xy$-monotone grid path connects the two endpoints without hitting an…
It is shown that every orthogonal terrain, i.e., an orthogonal (right-angled) polyhedron based on a rectangle that meets every vertical line in a segment, has a grid unfolding: its surface may be unfolded to a single non-overlapping piece…
A small polygon is a polygon of unit diameter. The maximal perimeter and the maximal width of a convex small polygon with $n=2^s$ vertices are not known when $s \ge 4$. In this paper, we construct a family of convex small $n$-gons, $n=2^s$…
A problem of Erd\H{o}s asks for extremal conditions forcing edge-disjoint cycles with a prescribed nested structure. In the geometric version, the nesting is required to be noncrossing with respect to the cyclic orders. Fern\'andez, Kim,…
By using a suitable triple cover we show how to possibly model the construction of a minimal surface with positive genus spanning all six edges of a tetrahedron, working in the space of BV functions and interpreting the film as the boundary…
We develop a theory for the existence of perfect matchings in hypergraphs under quite general conditions. Informally speaking, the obstructions to perfect matchings are geometric, and are of two distinct types: 'space barriers' from convex…
This paper focuses on vertices of the master corner polyhedra $P(G,g_0),$ the core of the group-theoretical approach to integer linear programming. We introduce two combinatorial operations that transform each vertex of $P(G,g_0)$ to…
This research provides algorithms and numerical methods to geometrically control the magnitude of the internal and external forces in the reciprocal diagrams of 3D/Polyhedral Graphic statics (3DGS). In 3DGS, the form of the structure and…
We prove that any compact semi-algebraic set is homeomorphic to the solution space of some art gallery problem. Previous works have established similar universality theorems, but holding only up to homotopy equivalence, rather than…
A complete graph is the graph in which every two vertices are adjacent. For a graph $G=(V,E)$, the complete width of $G$ is the minimum $k$ such that there exist $k$ independent sets $\mathtt{N}_i\subseteq V$, $1\le i\le k$, such that the…
We consider the edge-isoperimetric problem on the graph of the infinite grid $\mathbb{N}^{2}$ in the $\ell_{\infty}$ metric. We first show that the solutions are not nested, so that techniques other than compressions have to be used. We…
In the $2$-dimensional $n$-body problem, $n\ge 3$, in spaces of constant curvature, $\kappa\ne 0$, we study polygonal homographic solutions. We first provide necessary and sufficient conditions for the existence of these orbits and then…
For a compact right-angled polyhedron $R$ in $\mathbb H^3$ denote by $\operatorname{vol} (R)$ the volume and by $\operatorname{vert} (R)$ the number of vertices. Upper and lower bounds for $\operatorname{vol} (R)$ in terms of…
We prove that every $n$ vertex linear triple system with $m$ edges has at least $m^6/n^7$ copies of a pentagon, provided $m>100 \, n^{3/2}$. This provides the first nontrivial bound for a question posed by Jiang and Yepremyan. More…
A self-avoiding polygon is a lattice polygon consisting of a closed self-avoiding walk on a square lattice. Surprisingly little is known rigorously about the enumeration of self-avoiding polygons, although there are numerous conjectures…
In this paper, we study two generalizations of Vertex Cover and Edge Cover, namely Colorful Vertex Cover and Colorful Edge Cover. In the Colorful Vertex Cover problem, given an $n$-vertex edge-colored graph $G$ with colors from $\{1,…