English
Related papers

Related papers: A Complete List of All Convex Polyhedra Made by Gl…

200 papers

Which convex 3D polyhedra can be obtained by gluing several regular hexagons edge-to-edge? It turns out that there are only 15 possible types of shapes, 5 of which are doubly-covered 2D polygons. We give examples for most of them, including…

Computational Geometry · Computer Science 2020-02-07 Elena Arseneva , Stefan Langerman

We investigate how to make the surface of a convex polyhedron (a polytope) by folding up a polygon and gluing its perimeter shut, and the reverse process of cutting open a polytope and unfolding it to a polygon. We explore basic enumeration…

Computational Geometry · Computer Science 2007-05-23 Erik D. Demaine , Martin L. Demaine , Anna Lubiw , Joseph O'Rourke

We present an algorithm that enumerates and classifies all edge-to-edge gluings of unit squares that correspond to convex polyhedra. We show that the number of such gluings of $n$ squares is polynomial in $n$, and the algorithm runs in time…

Computational Geometry · Computer Science 2021-11-30 Stefan Langerman , Nicolas Potvin , Boris Zolotov

We show that convex pentagons that can generate edge-to-edge monohedral tilings of the plane can be classified into exactly eight types. Using these results, it is also proved that no single convex polygon can be an aperiodic prototile…

Metric Geometry · Mathematics 2017-07-11 Teruhisa Sugimoto

We develop a systematic method for computing the angle combinations at all vertices in an edge-to-edge tiling of the sphere by pentagons with the same five angles. The method is a useful and necessary step in many tiling problems about…

Metric Geometry · Mathematics 2023-09-27 Hoi Ping Luk , Min Yan

Congruent polygons are congruent in angles as well as in edge lengths. We concentrate on the angle aspect, and investigate how tilings of the sphere by congruent pentagons can be determined by the angle information only. We also investigate…

Combinatorics · Mathematics 2026-04-29 Robert Barish , Hoi Ping Luk , Min Yan

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

If all tiles in a tiling are congruent, the tiling is called monohedral. Tiling by convex polygons is called edge-to-edge if any two convex polygons are either disjoint or share one vertex or one entire edge in common. In this paper, we…

Metric Geometry · Mathematics 2017-12-27 Teruhisa Sugimoto

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

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

It is unknown whether every polycube (polyhedron constructed by gluing cubes face-to-face) has an edge unfolding, that is, cuts along edges of the cubes that unfolds the polycube to a single nonoverlapping polygon in the plane. Here we…

Computational Geometry · Computer Science 2022-05-24 Erik D. Demaine , Martin L. Demaine , David Eppstein , Joseph O'Rourke

Given a convex polyhedral surface P, we define a tailoring as excising from P a simple polygonal domain that contains one vertex v, and whose boundary can be sutured closed to a new convex polyhedron via Alexandrov's Gluing Theorem. In…

Metric Geometry · Mathematics 2022-05-24 Joseph O'Rourke , Costin Vilcu

A spherical polyhedron surface is a triangulated surface obtained by isometric gluing of spherical triangles. For instance, the boundary of a generic convex polytope in the 3-sphere is a spherical polyhedron surface. This paper investigates…

Geometric Topology · Mathematics 2016-09-07 Feng Luo

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

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

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 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

An unfolding of a polyhedron is produced by cutting the surface and flattening to a single, connected, planar piece without overlap (except possibly at boundary points). It is a long unsolved problem to determine whether every polyhedron…

Computational Geometry · Computer Science 2007-05-23 Mirela Damian , Robin Flatland , Joseph O'Rourke

We describe how to construct a dodecahedron, tetrahedron, cube, and octahedron out of pvc pipes using standard fittings.

History and Overview · Mathematics 2017-05-02 David Glickenstein

In this work, we show the geometric properties of a family of polyhedra obtained by folding a regular tetrahedron along regular triangular grids. Each polyhedron is identified by a pair of nonnegative integers. The polyhedron can be cut…

Computational Geometry · Computer Science 2019-12-04 Seri Nishimoto , Takashi Horiyama , Tomohiro Tachi
‹ Prev 1 2 3 10 Next ›