Related papers: Steinitz Theorems for Orthogonal Polyhedra

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,…

Two triangles are called orthologic if the perpendiculars from the vertices of one of them to the sides of the other are concurrent. In this paper, we explore the concept of orthology from various points of view. Mostly we work in terms of…

We define treetopes, a generalization of the three-dimensional roofless polyhedra (Halin graphs) to arbitrary dimensions. Like roofless polyhedra, treetopes have a designated base facet such that every face of dimension greater than one…

A geometric graph is a graph drawn in the plane so that its vertices and edges are represented by points in general position and straight line segments, respectively. A vertex of a geometric graph is called pointed if it lies outside of the…

An associahedron is a polytope whose vertices correspond to the triangulations of a convex polygon and whose edges correspond to flips between them. A particularly elegant realization of the associahedron, due to S. Shnider and S. Sternberg…

We determine the combinatorial types of all the 3-dimensional simple convex polytopes in R^3 that can be realized as mean curvature convex (or totally geodesic) Riemannian polyhedra with non-obtuse dihedral angles in Riemannian 3-manifolds…

We construct compact polyhedra with $m$-gonal faces whose links are generalized 3-gons. It gives examples of cocompact hyperbolic bildings of type $P(m,3)$. For $m=3$ we get compact spaces covered by Euclidean buildings of type $A_2$.

Given a convex polygon of $n$ sides, one can draw $n$ disks (called side disks) where each disk has a different side of the polygon as diameter and the midpoint of the side as its center. The intersection graph of such disks is the…

For a Riemannian polyhedra, we study the geometry of the unit ball for the unidimensional stable norm (stable ball). In the case of a unidimensional Riemannian polyhedra (graph), we show that the stable ball is a polytope whose vertices are…

We prove that any polyhedron of genus zero or genus one built out of rectangular faces must be an orthogonal polyhedron, but that there are nonorthogonal polyhedra of genus seven all of whose faces are rectangles. This leads to a resolution…

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…

A sequence $\sigma$ of $p$ non-negative integers is unigraphic if it is the degree sequence of exactly one graph, up to isomorphism. A polyhedral graph is a $3$-connected, planar graph. We investigate which sequences are unigraphic with…

Every three-connected planar graph with n vertices has a drawing on an O(n^2) x O(n^2) grid in which all faces are strictly convex polygons. These drawings are obtained by perturbing (not strictly) convex drawings on O(n) x O(n) grids. More…

A Klein polyhedron is defined as the convex hull of nonzero lattice points inside an orthant of $\R^n$. It generalizes the concept of continued fraction. In this paper facets and edge stars of vertices of a Klein polyhedron are considered…

If we label the vertices of a triangle with 1, 2 and 4, and the orthocentre with 7, then any of the four numbers 1, 2, 4, 7 is the nim-sum of the other three and is their orthocentre. Regard the triangle as an orthocentric quadrangle.…

A regular polyhedron of type {p, q} has at least 2pq flags, and it is called tight if it has exactly 2pq flags. The values of p and q for which there exist tight orientably regular polyhedra were previously known. We determine for which…

Skeletal polyhedra are discrete connected structures consisting of finite (planar or skew) or infinite (linear, planar, or spatial) polygons as faces, with two faces on each edge and a circular vertex figure at each vertex. The present…

Trivalent $2$-stratifolds are a generalization of $2$-manifolds in that there are disjoint simple closed curves where three sheets meet. We obtain a classification of $1$-connected $2$-stratifolds in terms of their associated labeled graphs…

Regular polygonal complexes in euclidean 3-space are discrete polyhedra-like structures with finite or infinite polygons as faces and with finite graphs as vertex-figures, such that their symmetry groups are transitive on the flags. The…

Starting from a finite simple graph $G$, for each eigenvalue $\theta$ of its adjacency matrix one can construct a convex polytope $P_G(\theta)$, the so called $\theta$-eigenpolytop of $G$. For some polytopes this technique can be used to…