English
Related papers

Related papers: Edge Tessellation and Stamp Foldings Puzzles

200 papers

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…

Computational Geometry · Computer Science 2026-01-21 David Eppstein

We analyze the problem of quadrangulating a $n$-sided patch, each side at its boundary subdivided into a given number of edges, using a single irregular vertex (or none, when $n = 4$) that breaks the otherwise fully regular lattice. We…

Graphics · Computer Science 2022-07-15 Marco Tarini

Over the past decade, we have designed six typefaces based on mathematical theorems and open problems, specifically computational geometry. These typefaces expose the general public in a unique way to intriguing results and hard problems in…

Computational Geometry · Computer Science 2014-10-02 Erik D. Demaine , Martin L. Demaine

The tilings of the 2-dimensional sphere by congruent triangles have been extensively studied, and the edge-to-edge tilings have been completely classified. However, not much is known about the tilings by other congruent polygons. In this…

Combinatorics · Mathematics 2013-01-07 Honghao Gao , Nan Shi , Min Yan

A tessellation of a graph is a partition of its vertices into vertex disjoint cliques. A tessellation cover of a graph is a set of tessellations that covers all of its edges. The $t$-tessellability problem aims to decide whether there is a…

Discrete Mathematics · Computer Science 2021-06-24 A. Abreu , L. Cunha , T. Fernandes , C. de Figueiredo , L. Kowada , F. Marquezino , D. Posner , R. Portugal

This paper presents an additional class of regular polyhedra--envelope polyhedra--made of regular polygons, where the arrangement of polygons (creating a single surface) around each vertex is identical; but dihedral angles between faces…

Metric Geometry · Mathematics 2019-08-16 J. Richard Gott

We describe a general family of curved-crease folding tessellations consisting of a repeating "lens" motif formed by two convex curved arcs. The third author invented the first such design in 1992, when he made both a sketch of the crease…

Computational Geometry · Computer Science 2015-02-12 Erik D. Demaine , Martin L. Demaine , David A. Huffman , Duks Koschitz , Tomohiro Tachi

For each integer n, an n-folding curve is obtained by folding n times a strip of paper in two, possibly up or down, and unfolding it with right angles. Generalizing the usual notion of infinite folding curve, we define complete folding…

Combinatorics · Mathematics 2010-06-30 Francis Oger

Edge-to-edge tilings of the sphere by congruent quadrilaterals are completely classified in a series of three papers. This second one applies the powerful tool of trigonometric Diophantine equations to classify the case of…

Combinatorics · Mathematics 2023-06-06 Yixi Liao , Erxiao Wang

We study edge-to-edge tilings of the sphere by edge congruent pentagons, under the assumption that there are tiles with all vertices having degree 3. We develop the technique of neighborhood tilings and apply the technique to completely…

Metric Geometry · Mathematics 2013-04-16 Ka Yue Cheuk , Ho Man Cheung , Min Yan

Conventional three-dimensional crystal lattices are terminated by surfaces, which can demonstrate complex rebonding and rehybridisation, localised strain and dislocation formation. Two dimensional crystal lattices, of which graphene is the…

Mesoscale and Nanoscale Physics · Physics 2012-07-23 Viktoria V. Ivanovskaya , Philipp Wagner , Alberto Zobelli , Irene Suarez-Martinez , Abu Yaya , Christopher P. Ewels

When twisting a strip of paper or acetate under high longitudinal tension, one observes, at some critical load, a buckling of the strip into a regular triangular pattern. Very similar triangular facets have recently been observed in…

Classical Physics · Physics 2011-11-10 A. P. Korte , E. L. Starostin , G. H. M. van der Heijden

We consider regular tessellations of the plane as infinite graphs in which $q$ edges and $q$ faces meet at each vertex, and in which $p$ edges and $p$ vertices surround each face. For $1/p + 1/q = 1/2$, these are tilings of the Euclidean…

Combinatorics · Mathematics 2010-06-23 Alice Paul , Nicholas Pippenger

A topologically minimal surface may be isotoped into a normal form with respect to a fixed triangulation. If the intersection with each tetrahedron is simply connected, then the pieces of this normal form are triangles, quadrilaterals, and…

Geometric Topology · Mathematics 2018-03-16 David Bachman , Ryan Derby-Talbot , Eric Sedgwick

A tiling of the sphere by triangles, squares, or hexagons is convex if every vertex has at most 6, 4, or 3 polygons adjacent to it, respectively. Assigning an appropriate weight to any tiling, our main result is explicit formulas for the…

Geometric Topology · Mathematics 2018-06-13 Philip Engel , Peter Smillie

In this study, the properties of convex pentagons that can form rotationally symmetric edge-to-edge tilings are discussed. Because the rotationally symmetric tilings are formed by concave octagons that are generated by two convex pentagons…

Metric Geometry · Mathematics 2022-05-04 Teruhisa Sugimoto

A zigzag in a map (a $2$-cell embedding of a connected graph in a connected closed $2$-dimensional surface) is a cyclic sequence of edges satisfying the following conditions: 1) any two consecutive edges lie on the same face and have a…

Combinatorics · Mathematics 2019-04-04 Mark Pankov , Adam Tyc

In this paper we give a classification of tilings of the sphere by congruent quadrilaterals with exactly two equal edges. The tilings are the earth map tilings, $(p,q)$-earth map tilings and their flip modifications, and quadrilateral…

Combinatorics · Mathematics 2021-09-06 Ho Man Cheung , Hoi Ping Luk

A translation surface is a surface formed by identifying edges of a collection of polygons in the complex plane that are parallel and of equal length using only translations. We determined that the same circle packing can be realized on…

Geometric Topology · Mathematics 2024-01-22 Anton Levonian

Edge-matching problems, also called edge matching puzzles, are abstractions of placement problems with neighborhood conditions. Pieces with colored edges have to be placed on a board such that adjacent edges have the same color. The problem…

Data Structures and Algorithms · Computer Science 2017-03-29 Martin Ebbesen , Paul Fischer , Carsten Witt