English
Related papers

Related papers: Envelope Polyhedra

200 papers

Sets of three types of convex pentagons that are aperiodic with no matching conditions on the edges are created from a chiral aperiodic monotile Tile(1, 1). This method divides the interior of Tile(1,1) into five convex polygons with five…

Metric Geometry · Mathematics 2025-01-16 Teruhisa Sugimoto

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

We study the abstract regular polyhedra with automorphism groups that act faithfully on their vertices, and show that each non-flat abstract regular polyhedron covers a "vertex-faithful" polyhedron with the same number of vertices. We then…

Combinatorics · Mathematics 2020-06-01 Gabe Cunningham , Mark Mixer

We consider triangle faced convex polyhedra inscribed in the unit sphere $S^2$ in ${\Bbb{R}}^3$. One way of measuring their deviation from regular polyhedra with triangular faces is to consider the quotient of the lengths of the longest and…

Metric Geometry · Mathematics 2019-09-09 E. Makai,

We study the shape of inflated surfaces introduced in \cite{B1} and \cite{P1}. More precisely, we analyze profiles of surfaces obtained by inflating a convex polyhedron, or more generally an almost everywhere flat surface, with a symmetry…

Differential Geometry · Mathematics 2015-05-13 Igor Pak , Jean-Marc Schlenker

Over a decade ago, it was shown that every edge unfolding of the Platonic solids was without self-overlap, yielding a valid net. We consider this property for regular polytopes in arbitrary dimensions, notably the simplex, cube, and…

Computational Geometry · Computer Science 2021-11-03 Satyan L. Devadoss , Matthew Harvey

We introduce some compact orbifolds on which there is a certain finite group action having a simple convex polytope as the orbit space. We compute the orbifold fundamental group and homology groups of these orbifolds. We calculate the…

Algebraic Topology · Mathematics 2011-05-10 Soumen Sarkar

We present two versions of a method for generating all triangulations of any punctured surface in each of these two families: (1) triangulations with inner vertices of degree at least 4 and boundary vertices of degree at least 3 and (2)…

Combinatorics · Mathematics 2015-07-16 Maria-Jose Chavez , Antonio Quintero , Maria-Trinidad Villar , Seiya Negami

The simplicial wedge construction on simplicial complexes and simple polytopes has been used by a variety of authors to study toric and related spaces, including non-singular toric varieties, toric manifolds, intersections of quadrics and…

Algebraic Topology · Mathematics 2018-01-24 Anthony Bahri , Soumen Sarkar , Jongbaek Song

We classify the topological types of surfaces in the 3-dimensional unit sphere that contain both a great and a small circle through each point. In particular, these surfaces are homeomorphic to one of five normal forms and are either the…

Algebraic Geometry · Mathematics 2025-11-20 Niels Lubbes

In this article, we describe symplectic and complex toric spaces associated to the five regular convex polyhedra. The regular tetrahedron and the cube are rational and simple, the regular octahedron is not simple, the regular dodecahedron…

Symplectic Geometry · Mathematics 2016-12-04 Fiammetta Battaglia , Elisa Prato

The icosidodecahedron has 30 vertices, one at the center of each edge of a regular icosahedron -- or equivalently, one at the center of each edge of a regular dodecahedron. It is a beautiful, highly symmetrical shape. But it is just a…

Combinatorics · Mathematics 2023-09-28 John C. Baez

We prove that any finite polyhedral manifold in 3D can be continuously flattened into 2D while preserving intrinsic distances and avoiding crossings, answering a 19-year-old open problem, if we extend standard folding models to allow for…

Computational Geometry · Computer Science 2021-05-25 Zachary Abel , Erik D. Demaine , Martin L. Demaine , Jason S. Ku , Jayson Lynch , Jin-ichi Itoh , Chie Nara

The notion of a spiral unfolding of a convex polyhedron, resulting by flattening a special type of Hamiltonian cut-path, is explored. The Platonic and Archimedian solids all have nonoverlapping spiral unfoldings, although among generic…

Computational Geometry · Computer Science 2015-10-20 Joseph O'Rourke

Using a quartic surface and its rational curves we can give an infinite number of integer hexahedra; these are 6 sided 3d solids, each face a trapezoid, with all sides and diagonals having intger lengths.

History and Overview · Mathematics 2009-09-25 Roger Alperin

We address the unsolved problem of unfolding prismatoids in a new context, viewing a "topless prismatoid" as a convex patch---a polyhedral subset of the surface of a convex polyhedron homeomorphic to a disk. We show that several natural…

Computational Geometry · Computer Science 2012-05-10 Joseph O'Rourke

It is well-known that every isosceles tetrahedron (disphenoid) admits infinitely many simple closed geodesics on its surface. They can be naturally enumerated by pairs of co-prime integers $n > m > 1$ with two additional cases $(1,0)$ and…

Metric Geometry · Mathematics 2023-12-19 Vladimir Yu. Protasov

Point cloud reconstruction from raw point cloud has been an important topic in computer graphics for decades, especially due to its high demand in modeling and rendering applications. An important way to solve this problem is establishing a…

Computer Vision and Pattern Recognition · Computer Science 2025-03-17 Hui Tian , Kai Xu

Polypolyhedra are edge-transitive compounds of polyhedra. In this paper we use group theory to determine the number of distinct polypolyhedra whose symmetry group is any given finite irreducible Coxeter group. We apply this result in order…

We consider facet-Hamiltonian cycles of polytopes, defined as cycles in their skeleton such that every facet is visited exactly once. These cycles can be understood as optimal watchman routes that guard the facets of a polytope. We consider…

Combinatorics · Mathematics 2024-11-05 Hugo Akitaya , Jean Cardinal , Stefan Felsner , Linda Kleist , Robert Lauff