Related papers: An Efficient Enumeration of Flat-Foldings : Study …
We develop a theoretical framework for rigid origami, and show how this framework can be used to connect rigid origami and results from cognate areas, such as the rigidity theory, graph theory, linkage folding and computer science. First,…
This article shows how to find the solution of an arbitrary quintic equation by performing two simultaneous folds on a sheet of paper. The folds achieve specific incidences between a set of points and lines that are determined by the…
Finite size effects for the Ising Model coupled to two dimensional random surfaces are studied by exploiting the exact results from the 2-matrix models. The fixed area partition function is numerically calculated with arbitrary precision by…
Horiyama et al. (AAAI 2024) studied the problem of generating graph instances that possess a unique minimum vertex cover under specific conditions. Their approach involved pre-assigning certain vertices to be part of the solution or…
Origami metamaterial design enables drastic qualitative changes in the response properties of a thin sheet via the addition of a repeating pattern of folds based around a rigid folding motion. Known also as a mechanism, this folding motion…
Enumeration algorithms have been one of recent hot topics in theoretical computer science. Different from other problems, enumeration has many interesting aspects, such as the computation time can be shorter than the total output size, by…
Developing engineering systems that rely on flow-induced reconfiguration, the phenomenon where a structure deforms under flow to reduce its drag, requires design tools that can predict the behavior of these flexible structures. Current…
This paper introduces mixed-integer optimization methods to solve regression problems that incorporate fairness metrics. We propose an exact formulation for training fair regression models. To tackle this computationally hard problem, we…
The Miura vertex is a versatile origami pattern found in a variety of mechanisms. Previous papers have derived and validated a closed-form solution for the kinematics of a symmetric Miura vertex, but the motion of an asymmetric vertex has…
We present an algorithm that enumerates all the minimal triangulations of a graph in incremental polynomial time. Consequently, we get an algorithm for enumerating all the proper tree decompositions, in incremental polynomial time, where…
Calculations of the Fourier transform of a constant quantity over an area or volume defined by polygons (connected vertices) are often useful in modeling wave scattering, or in fourier-space filtering of real-space vector-based volumes and…
Motivated by a question in origami, we consider sets of points in the complex plane constructed in the following way. Let $L_\alpha(p)$ be the line in the complex plane through $p$ with angle $\alpha$ (with respect to the real axis). Given…
We propose a novel computational framework for modeling and simulating origami structures. In this framework, bilinear solid-shell elements are employed to model the origami panels while crease folding is considered through the angle…
In this work, we propose a novel single-end morphing capacitive sensing method for shape tracking, FxC, by combining Folding origami structures and Capacitive sensing to detect the morphing structural motions using state-of-the-art sensing…
In this paper, we will show methods to interpret some rigid origami with higher degree vertices as the limit case of structures with degree-4 supplementary angle vertices. The interpretation is based on separating each crease into two…
We propose a new type of approximate counting algorithms for the problems of enumerating the number of independent sets and proper colorings in low degree graphs with large girth. Our algorithms are not based on a commonly used Markov chain…
We discuss well known geometric constructions via paper-folding. The note is written primary for school students.
We introduce a generalized forward-backward splitting method with penalty term for solving monotone inclusion problems involving the sum of a finite number of maximally monotone operators and the normal cone to the nonempty set of zeros of…
Continuing results from JCDCGGG 2016 and 2017, we solve several new cases of the simple foldability problem -- deciding which crease patterns can be folded flat by a sequence of (some model of) simple folds. We give new efficient algorithms…
Consider an oriented curve $\Gamma$ in a domain $D$ in the plane $\boldsymbol R^2$. Thinking of $D$ as a piece of paper, one can make a curved folding in the Euclidean space $\boldsymbol R^3$. This can be expressed as the image of an…