English
Related papers

Related papers: Envelope Polyhedra

200 papers

A well-known result in the study of convex polyhedra, due to Minkowski, is that a convex polyhedron is uniquely determined (up to translation) by the directions and areas of its faces. The theorem guarantees existence of the polyhedron…

Computational Geometry · Computer Science 2017-12-06 Giuseppe Sellaroli

The main ob jective of this research is to find the different types of elliptic triangulations for planar discs and spheres. We begin in Chapter 1 with the mandatory introduction. In the second chapter we define and study the notion of a…

Geometric Topology · Mathematics 2007-05-23 Panchadcharam Elango

The regular polyhedra have the highest order of 3D symmetries and are exceptionally at- tractive templates for (self)-assembly using minimal types of building blocks, from nano-cages and virus capsids to large scale constructions like glass…

Computational Geometry · Computer Science 2015-07-31 Muhibur Rasheed , Chandrajit Bajaj

Given a combinatorial description $C$ of a polyhedron having $E$ edges, the space of dihedral angles of all compact hyperbolic polyhedra that realize $C$ is generally not a convex subset of $\mathbb{R}^E$ \cite{DIAZ}. If $C$ has five or…

Geometric Topology · Mathematics 2007-05-23 Roland K. W. Roeder

We study two notions. One is that of spindle convexity. A set of circumradius not greater than one is spindle convex if, for any pair of its points, it contains every short circular arc of radius at least one, connecting them. The other…

Metric Geometry · Mathematics 2011-10-20 Karoly Bezdek , Zsolt Langi , Marton Naszodi , Peter Papez

We classify edge-to-edge tilings of the sphere by congruent pentagons with the edge combination $a^4b$ and with any irrational angle in degree: they are three $1$-parameter families of pentagonal subdivisions of the Platonic solids, with…

Combinatorics · Mathematics 2024-12-12 Junjie Shu , Yixi Liao , Erxiao Wang

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

Unlike the situation in the classical theory of convex polytopes, there is a wealth of semi-regular abstract polytopes, including interesting examples exhibiting some unexpected phenomena. We prove that even an equifacetted semi-regular…

Combinatorics · Mathematics 2011-09-13 Tomaz Pisanski , Egon Schulte , Asia Ivic Weiss

We classify edge-to-edge tilings of the sphere by congruent pentagons with the edge combination $a^4b$ and with rational angles in degree: they are a one-parameter family of symmetric $a^4b$-pentagonal subdivisions of the tetrahedron with…

Combinatorics · Mathematics 2025-07-10 Jinjin Liang , Yixi Liao , Wenchuan Hu , Erxiao Wang

The space of shapes of a polyhedron with given total angles less than 2\pi at each of its n vertices has a Kaehler metric, locally isometric to complex hyperbolic space CH^{n-3}. The metric is not complete: collisions between vertices take…

Geometric Topology · Mathematics 2007-05-23 William P. Thurston

The shape of crystalline nanoparticles (NP) can often be described by polyhedra with flat facet surfaces. Thus, structural studies of polyhedral bodies can help to describe geometric details of NPs. Here we consider compact polyhedra of…

Mesoscale and Nanoscale Physics · Physics 2023-07-24 Klaus E. Hermann

It has been a long-standing challenge to find a geometric object underlying the cosmological wavefunction for Tr($\phi^3$) theory, generalizing associahedra and surfacehedra for scattering amplitudes. In this note we describe a new class of…

High Energy Physics - Theory · Physics 2025-11-10 Nima Arkani-Hamed , Carolina Figueiredo , Francisco Vazão

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

We classify the dihedral edge-to-edge tilings of the sphere by squares and rhombi.

Combinatorics · Mathematics 2024-03-12 Hoi Ping Luk

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 explore several families of flip-graphs, all related to polygons or punctured polygons. In particular, we consider the topological flip-graphs of once-punctured polygons which, in turn, contain all possible geometric flip-graphs of…

Combinatorics · Mathematics 2018-09-10 Hugo Parlier , Lionel Pournin

Polypolyhedra (after R. Lang) are compounds of edge-transitive 1-skeleta. There are 54 topologically different polypolyhedra, and each has icosidodecahedral, cuboctahedral, or tetrahedral symmetry, all are realizable as modular origami…

Metric Geometry · Mathematics 2016-01-14 Sarah-Marie Belcastro , Thomas C. Hull

This paper details an algorithm for unfolding a class of convex polyhedra, where each polyhedron in the class consists of a convex cap over a rectangular base, with several restrictions: the cap's faces are quadrilaterals, with vertices…

Computational Geometry · Computer Science 2007-09-12 Joseph O'Rourke

We show that every orthogonal polyhedron of genus at most 2 can be unfolded without overlap while using only a linear number of orthogonal cuts (parallel to the polyhedron edges). This is the first result on unfolding general orthogonal…

Computational Geometry · Computer Science 2016-11-02 Mirela Damian , Erik Demaine , Robin Flatland , Joseph O'Rourke

We show that every orthogonal polyhedron homeomorphic to a sphere can be unfolded without overlap while using only polynomially many (orthogonal) cuts. By contrast, the best previous such result used exponentially many cuts. More precisely,…

Computational Geometry · Computer Science 2011-12-21 Mirela Damian , Erik Demaine , Robin Flatland