Related papers: Orthogonal Fold & Cut
A variational framework is introduced to describe how a surface bends when it is subject to local constraints on its geometry. This framework is applied to describe the patterns of a folded sheet of paper. The unstretchability of paper…
Jigsaw puzzle solving, the problem of constructing a coherent whole from a set of non-overlapping unordered visual fragments, is fundamental to numerous applications, and yet most of the literature of the last two decades has focused thus…
This article extends the range of 1-DOF rigid-foldable developable quadrilateral creased papers. In a previous article, we put forward a sufficient and necessary condition for a quadrilateral creased paper to be rigid-foldable, and…
A graph is said to be orthogonalisable if the set of real symmetric matrices whose off-diagonal pattern is prescribed by its edges contains an orthogonal matrix. We determine some necessary and some sufficient conditions on the sizes of the…
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,…
Modeling folding surfaces with nonzero thickness is of practical interest for mechanical engineering. There are many existing approaches that account for material thickness in folding applications. We propose a new systematic and broadly…
In this article we describe a program -- called planar_draw -- to draw maps on oriented surfaces in the plane. The drawings are coded as tikz files that can easily be manipulated and used in latex documents. Next to plane maps -- a case for…
We offer a fractonic perspective on a familiar observation -- a flat sheet of paper can be folded only along a straight line if one wants to avoid the creation of additional creases or tears. Our core underlying technical result is the…
As two fundamental problems, graph cuts and graph matching have been investigated over decades, resulting in vast literature in these two topics respectively. However the way of jointly applying and solving graph cuts and matching receives…
Orthogonal polynomials in two variables on cubic curves are considered, including the case of elliptic curves. For an integral with respect to an appropriate weight function defined on a cubic curve, an explicit basis of orthogonal…
We introduce a simple cut-and-paste mechanism to construct both orientable and nonorientable four-manifolds from a given initial one. This mechanism alters the fundamental group while preserving other essential topological invariants. It…
This paper introduces a novel curve-based slicing method for generating planar layers with dynamically varying orientations in digital light processing (DLP) 3D printing. Our approach effectively addresses key challenges in DLP printing,…
An Orthogonally resolvable Matching Design OMD$(n, k)$ is a partition of the edges the complete graph $K_n$ into matchings of size $k$, called blocks, such that the blocks can be resolved in two different ways. Such a design can be…
Orthogonal graph drawings are used in applications such as UML diagrams, VLSI layout, cable plans, and metro maps. We focus on drawing planar graphs and assume that we are given an \emph{orthogonal representation} that describes the desired…
Origami describes rules for creating folded structures from patterns on a flat sheet, but does not prescribe how patterns can be designed to fit target shapes. Here, starting from the simplest periodic origami pattern that yields one…
A flipturn is an operation that transforms a nonconvex simple polygon into another simple polygon, by rotating a concavity 180 degrees around the midpoint of its bounding convex hull edge. Joss and Shannon proved in 1973 that a sequence of…
We prove several hardness results on folding origami crease patterns. Flat-folding finite crease patterns is fixed-parameter tractable in the ply of the folded pattern (how many layers overlap at any point) and the treewidth of an…
We define a new class of orthogonal polyhedra, called orthogrids, that can be unfolded without overlap with constant refinement of the gridded surface.
We present a rectangle-based segmentation algorithm that sets up a graph and performs a graph cut to separate an object from the background. However, graph-based algorithms distribute the graph's nodes uniformly and equidistantly on the…
A planar orthogonal drawing {\Gamma} of a connected planar graph G is a geometric representation of G such that the vertices are drawn as distinct points of the plane, the edges are drawn as chains of horizontal and vertical segments, and…