Related papers: Unfolding Orthotubes with a Dual Hamiltonian Path
A classic result of Brooks, Smith, Stone and Tutte associates to any finite planar network with distinguished source and sink vertices, a tiling of a rectangle by smaller subrectangles whose aspect ratios are given by the conductances of…
In this paper we have given an algorithmic proof of an long standing Barnette's conjecture (1969) that every 3-connected bipartite cubic planar graph is hamiltonian. Our method is quite different than the known approaches and it rely on the…
We study a one-parameter family of time-reversible Hamiltonian vector fields in $\mathbb{R}^4$, which has received great attention in the literature. On the one hand, it is due to the role it plays in the context of certain applications in…
Orthogonal drawings, i.e., embeddings of graphs into grids, are a classic topic in Graph Drawing. Often the goal is to find a drawing that minimizes the number of bends on the edges. A key ingredient for bend minimization algorithms is the…
A torus manifold is an even-dimensional manifold acted on by a half-dimensional torus with non-empty fixed point set and some additional orientation data. It may be considered as a far-reaching generalisation of toric manifolds from…
An origami extrusion is a folding of a 3D object in the middle of a flat piece of paper, using 3D gadgets which create faces with solid angles. In this paper we focus on 3D gadgets which create a top face parallel to the ambient paper and…
Round fold maps are smooth maps on closed manifolds which are locally represented as the product maps of Morse functions and identity maps on open disks and whose singularity is realized as concentrically embedded spheres. The author…
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for exact algorithms have been unable to avoid structural problems that appear for…
The hypercube \( Q_n \) contains a Hamiltonian path joining \( x \) and \( y \) (where $x$ and $y$ from the opposite partite set) containing \( P \) if and only if the induced subgraph of \( P \) is a linear forest, where none of these…
We define a notion for unfolding smooth, ruled surfaces, and prove that every smooth prismatoid (the convex hull of two smooth curves lying in parallel planes), has a nonoverlapping "volcano unfolding." These unfoldings keep the base…
Let $X$ be a perfectoid space with tilt $X^\flat$. We construct a canonical map $\theta:\operatorname{Pic} X^\flat\to\lim\operatorname{Pic} X$ where the (inverse) limit is taken over the $p$-power map, and show that $\theta$ is an…
In this work, the warped product of Hamilton spaces is introduced and it is shown that these spaces obtain Hamiltonian structure as well. Then, the geometric properties of warped product Hamilton spaces such as their nonlinear connections…
We describe an algorithm that morphs between two planar orthogonal drawings $\Gamma_I$ and $\Gamma_O$ of a connected graph $G$, while preserving planarity and orthogonality. Necessarily $\Gamma_I$ and $\Gamma_O$ share the same combinatorial…
We pose and answer several questions concerning the number of ways to fold a polygon to a polytope, and how many polytopes can be obtained from one polygon; and the analogous questions for unfolding polytopes to polygons. Our answers are,…
We extend the notion of a source unfolding of a convex polyhedron P to be based on a closed polygonal curve Q in a particular class rather than based on a point. The class requires that Q "lives on a cone" to both sides; it includes simple,…
We describe a search for plane-filling curves traversing all edges of a grid once. The curves are given by Lindenmayer systems with only one non-constant letter. All such curves for small orders on three grids have been found. For all…
A bounded curvature path is a continuously differentiable piecewise $C^2$ path with bounded absolute curvature that connects two points in the tangent bundle of a surface. In this note we give necessary and sufficient conditions for two…
An outerplanar graph is a planar graph that has a planar drawing with all vertices on the unbounded face. The matching complex of a graph is the simplicial complex whose faces are subsets of disjoint edges of the graph. In this paper we…
We study hyperbolic polyhedral surfaces with faces isometric to regular hyperbolic polygons satisfying that the total angles at vertices are at least $2\pi.$ The combinatorial information of these surfaces is shown to be identified with…
The space of complete orthonormal frames in Euclidean space is not path connected. In fact it has exactly two path components, containing respectively the coordinate frame of n standard coordinates and the frame with two coordinates…