English
Related papers

Related papers: Polyhedra, Complexes, Nets and Symmetry

200 papers

We show that four of the five Platonic solids' surfaces may be cut open with a Hamiltonian path along edges and unfolded to a polygonal net each of which can "zipper-refold" to a flat doubly covered parallelogram, forming a rather compact…

Computational Geometry · Computer Science 2010-10-21 Joseph O'Rourke

A maniplex of rank n s an n-valent properly edge-coloured graph that generalises, simultaneously, maps on surfaces and abstract polytopes. The problem of stability in maniplexes is a natural variant of the problem of stability in graphs. A…

Combinatorics · Mathematics 2026-02-04 Isabel Hubard , Micael Toledo

In this paper we finish the intensive study of three-dimensional Dirichlet stereohedra started by the second author and D. Bochis, who showed that they cannot have more than 80 facets, except perhaps for crystallographic space groups in the…

Combinatorics · Mathematics 2011-09-20 Pilar Sabariego , Francisco Santos

Answering a question posed by Joseph Malkevitch, we prove that there exists a polyhedral graph, with triangular faces, such that every realization of it as the graph of a convex polyhedron includes at least one face that is a scalene…

Computational Geometry · Computer Science 2021-07-02 David Eppstein

We study the trigonometry of non-Euclidean tetrahedra using tools from algebraic geometry. We establish a bijection between non-Euclidean tetrahedra and certain rational elliptic surfaces. We interpret the edge lengths and the dihedral…

Algebraic Geometry · Mathematics 2021-06-08 Daniil Rudenko

For a finite planar graph, it associates with some metric spaces, called (regular) spherical polyhedral surfaces, by replacing faces with regular spherical polygons in the unit sphere and gluing them edge-to-edge. We consider the class of…

Metric Geometry · Mathematics 2018-05-01 Yohji Akama , Bobo Hua , Yanhui Su

A pseudo-edge graph of a convex polyhedron K is a 3-connected embedded graph in K whose vertices coincide with those of K, whose edges are distance minimizing geodesics, and whose faces are convex. We construct a convex polyhedron K in…

Metric Geometry · Mathematics 2019-03-01 Nicholas Barvinok , Mohammad Ghomi

It is well-known that Klein's lectures on the icosahedron and the solution of equations of fifth degree is one of the most important and influential books of 19th-century mathematics. In the present paper, we will give the complex…

Number Theory · Mathematics 2007-05-23 Lei Yang

The L\"obell polyhedra form an infinite family of compact right-angled hyperbolic polyhedra in dimension $3$. We observe, through both elementary and more conceptual means, that the ``systoles'' of the L\"obell polyhedra approach $0$, so…

Geometric Topology · Mathematics 2023-04-26 Nikolay Bogachev , Sami Douba

Abstract polytopes generalize the face lattice of convex polytopes. A polytope is semiregular if its facets are regular and its automorphism group acts transitively on its vertices. In this paper we construct semiregular, facet-transitive…

Combinatorics · Mathematics 2025-12-17 Elías Mochán

We find all polyhedral graphs such that their complements are still polyhedral. These turn out to be all self-complementary.

Combinatorics · Mathematics 2021-02-24 Riccardo Walter Maffucci

Three types of geometric structure---grid triangulations, rectangular subdivisions, and orthogonal polyhedra---can each be described combinatorially by a regular labeling: an assignment of colors and orientations to the edges of an…

Computational Geometry · Computer Science 2010-07-02 David Eppstein

The concepts of symmetry and symmetry groups are at the heart of several developments in modern theoretical and mathematical physics. The present paper is devoted to a number of selected topics within this framework: Euclidean and rotation…

Mathematical Physics · Physics 2007-05-23 Giampiero Esposito , Giuseppe Marmo

We define a new class of orthogonal polyhedra, called orthogrids, that can be unfolded without overlap with constant refinement of the gridded surface.

Computational Geometry · Computer Science 2013-10-18 Mirela Damian , Erik Demaine , Robin Flatland

A $\textit{regular polygon surface}$ $M$ is a surface graph $(\Sigma, \Gamma)$ together with a continuous map $\psi$ from $\Sigma$ into Euclidean 3-space which maps faces to regular Euclidean polygons. When $\Sigma$ is homeomorphic to the…

Combinatorics · Mathematics 2018-04-17 Ian M. Alevy

We give coordinate-minimal geometric realizations in general position of all 865 vertex-minimal triangulations of the orientable surface of genus 2 in the 4x4x4-cube.

Metric Geometry · Mathematics 2007-05-23 Stefan Hougardy , Frank H. Lutz , Mariano Zelke

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

In this paper, we establish that the non-zero dihedral angles of hyperbolic Coxeter polyhedra of large dimensions are not arbitrarily small. Namely, for dimensions $n\geq 32$, they are of the form $\frac{\pi}{m}$ with $m\leq 6$. Moreover,…

Combinatorics · Mathematics 2025-07-08 Naomi Bredon

In this paper, we explore the geometry and the arithmetic of a family of polytopal sphere packings induced by regular polytopes in any dimension. We prove that every integral polytope is crystallographic, and we show that there are 11…

Combinatorics · Mathematics 2024-10-14 Iván Rasskin

This paper is an introduction to Coxeter polyhedra in spherical, Euclidean, and hyperbolic geometries. It consists of essentially two parts that could be read independently. In the first we introduce non-obtuse polyhedra in the spherical,…

Geometric Topology · Mathematics 2026-05-04 Bruno Martelli
‹ Prev 1 3 4 5 6 7 10 Next ›