English
Related papers

Related papers: Old and new geometric polyhedra with few vertices

200 papers

We classify the convex polytopes whose symmetry groups have two orbits on the flags. These exist only in two or three dimensions, and the only ones whose combinatorial automorphism group is also two-orbit are the cuboctahedron, the…

Metric Geometry · Mathematics 2016-03-09 Nicholas Matteo

Work of Kalelkar, Schleimer, and Segerman shows that, with some exceptions, the set of essential ideal triangulations of an orientable cusped hyperbolic 3-manifold is connected via 2-3 and 3-2 moves. It is natural to ask if the subgraph…

Geometric Topology · Mathematics 2025-09-03 Ian Benway

We give coordinate-minimal geometric realizations in general position for 17 of the 20 vertex-minimal triangulations of the orientable surface of genus 3 in the 5x5x5-cube.

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

Two tetrahedra are called orthologic if the lines through vertices of one and perpendicular to corresponding faces of the other are intersecting. This is equivalent to the orthogonality of non-corresponding edges. We prove that the…

Metric Geometry · Mathematics 2012-05-10 Hans-Peter Schröcker

It is known that we can always 3-triangulate (i.e. divide into tetrahedra) convex polyhedra but not always non-convex ones. Polyhedra topologically equivalent to sphere with $p$ handles, shortly $p$-toroids, could not be convex. So, it is…

Metric Geometry · Mathematics 2019-02-08 Milica Stojanović

In two series of papers we construct quasi regular polyhedra and their duals which are similar to the Catalan solids. The group elements as well as the vertices of the polyhedra are represented in terms of quaternions. In the present paper…

Mathematical Physics · Physics 2015-05-19 Mehmet Koca , Nazife Ozdes Koca , Ramazan Koc

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

A convex geometric graph is a graph whose vertices are the corners of a convex polygon P in the plane and whose edges are boundary edges and diagonals of the polygon. It is called triangulation-free if its non-boundary edges do not contain…

Combinatorics · Mathematics 2025-08-19 David Garber , Chaya Keller , Olga Nissenbaum , Shimon Aviram

In this article we present theoretical and computational results on the existence of polyhedral embeddings of graphs. The emphasis is on cubic graphs. We also describe an efficient algorithm to compute all polyhedral embeddings of a given…

Combinatorics · Mathematics 2023-06-22 Gunnar Brinkmann , Thomas Tucker , Nico Van Cleemput

A chiral polyhedron has a geometric symmetry group with two orbits on the flags, such that adjacent flags are in distinct orbits. Part I of the paper described the discrete chiral polyhedra in ordinary Euclidean 3-space with finite skew…

Metric Geometry · Mathematics 2007-05-23 Egon Schulte

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

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

A polyhedron is a graph $G$ which is simple, planar and 3-connected. In this note, we classify the family of strongly involutive self-dual polyhedra. The latter is done by using a well-known result due to Tutte characterizing 3-connected…

Combinatorics · Mathematics 2020-05-11 Javier Bracho , Luis Montejano , Eric Pauli , Jorge Luis Ramirez Alfonsin

A {\em $1-$vertex triangulation} of an oriented compact surface $S$ of genus $g$ is an embedded graph $T\subset S$ with a unique vertex such that all connected components of $S\setminus T$ are triangles (adjacent to exactly 3 edges of $T$).…

Combinatorics · Mathematics 2007-05-23 Roland Bacher , Alina Vdovina

The paper is devoted to finding the colorings of the edges of the 1-skeleton of triangulations of the 2-sphere in three colors so that for each face all three of its sides have different colors. First, by the method of adding one vertex…

Combinatorics · Mathematics 2022-09-14 Oleg Akchurin , Svitlana Bilun , Alexandr Prishlyak

Given a polyhedron (planar, $3$-connected graph) $G$, we investigate its common neighbourhood graph con($G$). For cubic ($3$-regular) polyhedra, we show that the planarity of con($G$) depends on the number of odd faces of $G$, and on their…

Combinatorics · Mathematics 2026-05-18 Riccardo W. Maffucci

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

The asymptotic behavior of open plane sections of triply periodic surfaces is dictated, for an open dense set of plane directions, by an integer second homology class of the three-torus. The dependence of this homology class on the…

Geometric Topology · Mathematics 2021-09-01 Roberto De Leo , Ivan A. Dynnikov

The geometry of the dual amplituhedron is generally described in reference to a particular triangulation. A given triangulation manifests only certain aspects of the underlying space while obscuring others, therefore understanding this…

High Energy Physics - Theory · Physics 2017-08-22 Michael Enciso

In [B.Gruenbaum, G.C. Shephard, Spherical tilings with transitivity properties, in: The geometric vein, Springer, New York, 1981, pp. 65-98], they proved "for every spherical normal tiling by congruent tiles, if it is isohedral, then the…

Metric Geometry · Mathematics 2013-12-12 Yohji Akama , Yudai Sakano