English
Related papers

Related papers: Locked and Unlocked Chains of Planar Shapes

200 papers

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…

Computational Geometry · Computer Science 2007-07-12 Joseph O'Rourke

We present structures comprised of identical convex polyhedra which are interlocked geometrically. These sets cannot be disassembled by removing individual polyhedra by translations and/or rotations. The shapes that permit interlocking…

Metric Geometry · Mathematics 2017-12-05 A. J. Kanel-Belov , A. V. Dyskin , Y. Estrin , E. Pasternak , I. A. Ivanov-Pogodaev

A notion of "radially monotone" cut paths is introduced as an effective choice for finding a non-overlapping edge-unfolding of a convex polyhedron. These paths have the property that the two sides of the cut avoid overlap locally as the cut…

Computational Geometry · Computer Science 2016-08-01 Joseph O'Rourke

Two structures are said to be equimorphic if each embeds in the other. Such structures cannot be expected to be isomorphic, and in this paper we investigate the special case of linear orders, here also called chains. In particular we…

Combinatorics · Mathematics 2014-07-11 C. Laflamme , M. Pouzet , R. Woodrow

A self-avoiding plane-filling curve cannot be periodic, but we show that it can satisfy the local isomorphism property. We investigate three families of coverings of the plane by finite sets of nonoverlapping self-avoiding curves which…

Combinatorics · Mathematics 2023-10-31 Francis Oger

We study the problem of deciding whether a crease pattern can be folded by simple folds (folding along one line at a time) under the infinite all-layers model introduced by [Akitaya et al., 2017], in which each simple fold is defined by an…

Computational Geometry · Computer Science 2019-01-25 Hugo A. Akitaya , Cordelia Avery , Joseph Bergeron , Erik D. Demaine , Justin Kopinsky , Jason Ku

A mechanical linkage is a mechanism made of rigid rods linked together by flexible joints, in which some vertices are fixed and others may move. The partial configuration space of a linkage is the set of all the possible positions of a…

Metric Geometry · Mathematics 2015-02-18 Mickaël Kourganoff

Macroscale chains have been proposed to give insight into the physics of molecular polymer systems. Nevertheless, understanding the rheological response of systems of quasi-one-dimensional semiflexible materials, such as bead-chain…

In this paper we show the existence of three dimensional rigid, and thus unfoldable, lattice conformations. The structure we found has 450+ bonds, and we provide a computer assisted proof of the existence of such structures. The existence…

Biomolecules · Quantitative Biology 2014-09-12 Folkert Tangerman , Rinni Bhansali

The existence of non-continuous invariant graphs (or strange non-chaotic attractors) in quasiperiodically forced systems has generated great interest, but there are still very few rigorous results about the properties of these objects. In…

Dynamical Systems · Mathematics 2007-05-23 Tobias H. Jaeger

Through extensive Monte Carlo simulations, we systematically study the effect of chain stiffness on the packing ability of linear polymers composed of hard spheres in extremely confined monolayers, corresponding effectively to 2D films.…

We study straight-line drawings of planar graphs with prescribed face areas. A plane graph is 'area-universal' if for every area assignment on the inner faces, there exists a straight-line drawing realizing the prescribed areas. For…

Computational Geometry · Computer Science 2018-09-05 Linda Kleist

In an upward planar 2-slope drawing of a digraph, edges are drawn as straight-line segments in the upward direction without crossings using only two different slopes. We investigate whether a given upward planar digraph admits such a…

Discrete Mathematics · Computer Science 2022-07-06 Jonathan Klawitter , Tamara Mchedlidze

Recently, cutting planes derived from maximal lattice-free convex sets have been studied intensively by the integer programming community. An important question in this research area has been to decide whether the closures associated with…

Optimization and Control · Mathematics 2013-01-10 Amitabh Basu , Robert Hildebrand , Matthias Köppe

A $configuration$ of a linkage $\Gamma$ is a possible positioning of $\Gamma$ in $\mathbb{R}^d$ and the collection of all such forms the configuration space $\mathcal{C}(\Gamma)$ of $\Gamma$. We here introduce the notion of the $symmetric…

Algebraic Topology · Mathematics 2022-07-19 David Blanc , Nir Shvalb

We present Twisted Edges, a unified framework for designing Linked Knot (LK) structures using labeled non-manifold surface meshes. While the concept of edge twists, originating in topological graph theory, is foundational to these designs,…

Graphics · Computer Science 2026-05-06 Tolga Talha Yıldız , Uğur Önal , Vinayak R. Krishnamurthy , Ergun Akleman

A linkage $\mathcal{L}$ consists of a graph $G=(V,E)$ and an edge-length function $\ell$. Deciding whether $\mathcal{L}$ can be realized as a planar straight-line embedding in $\mathbb{R}^2$ with edge length $\ell(e)$ for all $e \in E$ is…

Computational Geometry · Computer Science 2026-04-08 Thomas Depian , Carolina Haase , Martin Nöllenburg , André Schulz

Since the invention of polymer networks in the 19th century (e.g., crosslinked natural rubber by Goodyear), it has been a dogma that stiffer networks are less stretchable, a trade-off inherent to the molecular nature of polymer network…

Soft Condensed Matter · Physics 2024-05-13 Baiqiang Huang , Shifeng Nian , Li-Heng Cai

Examples suggest that there is a correspondence between L-spaces and 3-manifolds whose fundamental groups cannot be left-ordered. In this paper we establish the equivalence of these conditions for several large classes of such manifolds. In…

Geometric Topology · Mathematics 2011-07-26 Steven Boyer , Cameron McA. Gordon , Liam Watson

Simple closed curves in the plane can be mapped to nontrivial knots under the action of origami foldings that allow the paper to self-intersect. We show all tame knot types may be produced in this manner, motivating the development of a new…

Geometric Topology · Mathematics 2021-05-05 Joseph Slote , Thomas Bertschinger