English
Related papers

Related papers: Folding Polyiamonds into Octahedra

200 papers

Skeletal polyhedra and polygonal complexes in ordinary Euclidean 3-space are finite or infinite 3-periodic structures with interesting geometric, combinatorial, and algebraic properties. They can be viewed as finite or infinite 3-periodic…

Metric Geometry · Mathematics 2014-03-04 Egon Schulte

We consider a problem in computational origami. Given a piece of paper as a convex polygon $P$ and a point $f$ located within, fold every point on a boundary of $P$ to $f$ and compute a region that is safe from folding, i.e., the region…

Computational Geometry · Computer Science 2023-05-03 Nattawut Phetmak , Jittat Fakcharoenphol

In contrast to many known results concerning periodic tilings of the Euclidean plane with pentagons, here tilings with rotational symmetry are investigated. A certain class of convex pentagons is introduced. It can be shown that for any…

Metric Geometry · Mathematics 2025-07-02 Bernhard Klaassen

Entropic self-assembly is governed by the shape of the constituent particles, yet a priori prediction of crystal structures from particle shape alone is non-trivial for anything but the simplest of space-filling shapes. At the same time,…

Soft Condensed Matter · Physics 2023-05-16 Philipp W. A. Schönhöfer , Kai Sun , Xiaoming Mao , Sharon C. Glotzer

We study the problems of covering or partitioning a polygon $P$ (possibly with holes) using a minimum number of small pieces, where a small piece is a connected sub-polygon contained in an axis-aligned unit square. For covering, we seek to…

There exists a surface of a convex polyhedron P and a partition L of P into geodesic convex polygons such that there are no connected "edge" unfoldings of P without self-intersections (whose spanning tree is a subset of the edge skeleton of…

Computational Geometry · Computer Science 2008-10-06 Alexey S Tarasov

In terms of the number of triangles, it is known that there are more than exponentially many triangulations of surfaces, but only exponentially many triangulations of surfaces with bounded genus. In this paper we provide a first geometric…

Combinatorics · Mathematics 2018-05-10 Karim Adiprasito , Bruno Benedetti

The smallest maximum kissing-number Voronoi polyhedron of 3d spheres is the icosahedron and the tetrahedron is the smallest volume that can show up in Delaunay tessalation. No periodic lattice is consistent with either and hence these dense…

Soft Condensed Matter · Physics 2009-11-13 J. A. van Meel , D. Frenkel , P. Charbonneau

We state that any constant curvature Riemannian metric with conical singularities of constant sign curvature on a compact (orientable) surface $S$ can be realized as a convex polyhedron in a Riemannian or Lorentzian) space-form. Moreover…

Differential Geometry · Mathematics 2010-11-16 François Fillastre

It is a widely observed phenomenon in computer graphics that the size of the silhouette of a polyhedron is much smaller than the size of the whole polyhedron. This paper provides, for the first time, theoretical evidence supporting this for…

Computational Geometry · Computer Science 2009-09-29 Marc Glisse , Sylvain Lazard

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

Given a sequence of properly embedded minimal surfaces in a $3$-manifold with local bounds on area and genus, we prove subsequential convergence, smooth away from a discrete set, to a smooth embedded limit surface, possibly with…

Differential Geometry · Mathematics 2024-01-26 Brian White

We present a new type of polyominoes that can have transparent squares (holes). We show how these polyominoes can tile rectangles and we categorise them according to their tiling ability. We were able to categorise all but 6 polyominoes…

Computational Geometry · Computer Science 2015-10-29 Dmitry Kamenetsky , Tristrom Cooke

An orthant polyhedron is a polyhedron with $m$ hyperfaces, that could be realized as a section of the $m$-dimensional non-negative orthant. We classify all 2-dimensional orthant polyhedra and provide some partial results towards the…

Metric Geometry · Mathematics 2014-07-23 Nikolay Pechenkin

We construct compact polyhedra with $m$-gonal faces whose links are generalized 3-gons. It gives examples of cocompact hyperbolic bildings of type $P(m,3)$. For $m=3$ we get compact spaces covered by Euclidean buildings of type $A_2$.

Combinatorics · Mathematics 2007-05-23 Alina Vdovina

We classify the 3-dimensional hyperbolic polyhedral orbifolds that contain no embedded essential 2-suborbifolds, up to decomposition along embedded hyperbolic triangle orbifolds (turnovers). We give a necessary condition for a 3-dimensional…

Geometric Topology · Mathematics 2015-03-18 Shawn Rafalski

We describe the first-order variations of the angles of Euclidean, spherical or hyperbolic polygons under infinitesimal deformations such that the lengths of the edges do not change. Using this description, we introduce a vector-valued…

Differential Geometry · Mathematics 2007-06-24 Jean-Marc Schlenker

In this study, the properties of convex hexagons that can form rotationally symmetric edge-to-edge tilings are discussed. Because the convex hexagons are equilateral convex parallelohexagons, convex pentagons generated by bisecting the…

Metric Geometry · Mathematics 2022-05-05 Teruhisa Sugimoto

In this note we prove that any monohedral tiling of the closed circular unit disc with $k \leq 3$ topological discs as tiles has a $k$-fold rotational symmetry. This result yields the first nontrivial estimate about the minimum number of…

Geometric Topology · Mathematics 2019-10-10 Árpád Kurusa , Zsolt Lángi , Viktor Vígh

It is shown that there are examples of distinct polyhedra, each with a Hamiltonian path of edges, which when cut, unfolds the surfaces to a common net. In particular, it is established for infinite classes of triples of tetrahedra.

Computational Geometry · Computer Science 2011-06-09 Joseph O'Rourke