English
Related papers

Related papers: Face embeddings of Archimedean solids

200 papers

We show the existence of families of periodic polyhedra in spaces of constant curvature whose fundamental domains can be obtained by attaching prisms and antiprisms to Archimedean solids. These polyhedra have constant discrete curvature and…

Differential Geometry · Mathematics 2024-01-09 Christina Duffield , Daniel Freese , William Holt , Matthias Weber , Ramazan Yol

The associahedron is a convex polytope whose face poset is based on nonintersecting diagonals of a convex polygon. In this paper, given an arbitrary simple polygon P, we construct a polytopal complex analogous to the associahedron based on…

Combinatorics · Mathematics 2015-06-16 Satyan L. Devadoss , Rahul Shah , Xuancheng Shao , Ezra Winston

In this paper we construct the quasi regular polyhedra and their duals which are the generalizations of the Archimedean and Catalan solids respectively. This work is an extension of two previous papers of ours which were based on the…

Mathematical Physics · Physics 2012-03-22 Mehmet Koca , Mudhahir Al Ajmi , Saleh Al- Shidhani

Using the orthogonal connectedness, we introduce the notion of orthogonal decomposability of convex polytopes and study it in the case of Platonic and Archimedean solids. While doing so, we also encounter polytopes which are not…

Combinatorics · Mathematics 2026-03-10 Julia Q. Du , Xuemei He , Xiaotian Song , Daniela Stiller , Liping Yuan , Tudor Zamfirescu

We present new examples of topologically convex edge-ununfoldable polyhedra, i.e., polyhedra that are combinatorially equivalent to convex polyhedra, yet cannot be cut along their edges and unfolded into one planar piece without overlap.…

Computational Geometry · Computer Science 2020-07-30 Erik D. Demaine , Martin L. Demaine , David Eppstein

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

A ball-polyhedron is the intersection with non-empty interior of finitely many (closed) unit balls in Euclidean 3-space. One can represent the boundary of a ball-polyhedron as the union of vertices, edges, and faces defined in a rather…

Metric Geometry · Mathematics 2013-02-13 Karoly Bezdek , Marton Naszodi

An unfolding of a polyhedron along its edges is called a vertex unfolding if adjacent faces are allowed to be connected at not only an edge but also a vertex. Demaine et al showed that every triangulated polyhedron has a vertex unfolding.…

Combinatorics · Mathematics 2013-02-19 Toshiki Endo , Yuki Suzuki

We introduce Artinian Gorenstein algebras defined by the face posets of regular polyhedra. We consider the strong Lefschetz property and Hodge--Riemann relation for the algebras. We show the strong Lefschetz property of the algebras for all…

Commutative Algebra · Mathematics 2020-11-30 Akiko Yazawa

A polygonal complex in euclidean 3-space is a discrete polyhedron-like structure with finite or infinite polygons as faces and finite graphs as vertex-figures, such that a fixed number r of faces surround each edge. It is said to be regular…

Metric Geometry · Mathematics 2009-06-08 Daniel Pellicer , Egon Schulte

Skeletal polyhedra are discrete structures made up of finite, flat or skew, or infinite, helical or zigzag, polygons as faces, with two faces on each edge and a circular vertex-figure at each vertex. When a variant of Wythoff's construction…

Metric Geometry · Mathematics 2016-10-12 Egon Schulte , Abigail Williams

We consider a new treatment for making polyhedron nets referred to as ``apple peel unfolding'': drawing the nets as if we were peeling off appleskins. We define apple peel unfolding strictly and implement a program that derives the…

Computational Geometry · Computer Science 2026-04-20 Takashi Yoshino , Supanut Chaidee

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 prove that there are thirteen Archimedean/semiregular polyhedra by using Euler's polyhedral formula.

Geometric Topology · Mathematics 2007-05-23 Mark B. Villarino

Taking a representation-theoretic viewpoint, we construct a continuous associahedron motivated by the realization of the generalized associahedron in the physical setting. We show that our associahedron shares important properties with the…

Representation Theory · Mathematics 2025-12-02 Maitreyee C. Kulkarni , Jacob P. Matherne , Kaveh Mousavand , Job D. Rock

The main motivation here is a question: whether any polyhedron which can be subdivided into convex pieces without adding a vertex, and which has the same vertices as a convex polyhedron, is infinitesimally rigid. We prove that it is indeed…

Differential Geometry · Mathematics 2007-05-23 Robert Connelly , Jean-Marc Schlenker

We study nested complexes of building sets on the Las Vergnas face lattices of oriented matroids. Such a nested complex is the face lattice of an oriented matroid, obtained by iterated stellar subdivisions of the positive tope. If the…

Combinatorics · Mathematics 2025-09-22 Chiara Mantovani , Arnau Padrol , Vincent Pilaud

We analyze polyhedra composed of hexagons and triangles with three faces around each vertex, and their 3-regular planar graphs of edges and vertices, which we call "trihexes". Trihexes are analogous to fullerenes, which are 3-regular planar…

Combinatorics · Mathematics 2025-07-01 Linda Green , Stellen Li

Tutte's embedding theorem states that every 3-connected graph without a $K_5$ or $K_{3,3}$ minor (i.e. a planar graph) is embedded in the plane if the outer face is in convex position and the interior vertices are convex combinations of…

Computational Geometry · Computer Science 2023-03-28 Marc Alexa

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
‹ Prev 1 2 3 10 Next ›