The polyhedra tag has no usage guidance.

**7**

votes

**1**answer

165 views

### Convex deltahedra in higher dimensions

There are eight convex polyhedra whose faces are equilateral triangles, so-called
deltahedra:
(Image from here)
Q. Have the equivalent higher-dimensional ...

**6**

votes

**0**answers

87 views

### Constructing a polyhedron of maximal possible volume from given bounds on areas of its faces

Consider $n$ variables $a_1,...,a_n$ ranging over $\mathbb{R}^+$. Suppose we are given $n$ pairs of positive rational numbers $(p_1,q_1),...,(p_n,q_n)$ where each pair imposes bounds on the ...

**29**

votes

**3**answers

1k views

### About the ratio of the areas of a convex pentagon and the inner pentagon made by the five diagonals

Question : Letting $S{^\prime}$ be the area of the inner pentagon made by the five diagonals of a convex pentagon whose area is $S$, then find the max of $\frac{S^\prime}{S}$.
...

**1**

vote

**1**answer

113 views

### A question about rational convex cone

Edit: Fix a lattice $N = \mathbb{Z}^n$ and let $N_{\mathbb{R}} = N \otimes \mathbb{R}$.
Let $C(S)$ be a strongly convex rational cone in $N_{\mathbb{R}}$ generated by a finite set $S \subset N$, with ...

**6**

votes

**1**answer

155 views

### Embedding of flat surfaces

Let $S$ be a orientable compact surface with a flat euclidean structure with conical singularities (cf. [T] for instance). Let also $\mathcal P$ be a polyhedral euclidean decomposition of $S$ (with ...

**4**

votes

**3**answers

792 views

### Intersection of Polyhedra

I'm writing a collision detection algorithm, and so far I've been using Joseph O'Rourke's book "Computational Geometry in C" as reference. It outlines an algorithm to determine whether a point is ...

**9**

votes

**0**answers

234 views

### Bi-spherical polyhedra

Bicentric polygons have been studied: a polygon all of whose vertices lie on its
circumcirle, and whose incircle is tangent to every edge:
I have not been able to find a comparable literature ...

**4**

votes

**0**answers

164 views

### Tetrahedra passing through a hole

Assume a plane $P\subset\mathbb R^3$ has a hole $H$, and that the hole is topologically a compact disc. Being so, $P\setminus H$ does not separate the space. A regular tetrahedron $\sigma^3$ (of ...

**4**

votes

**1**answer

980 views

### Finding the vertices of a convex polyhedron from a set of planes

I'm new to computational geometry and advanced mathematics in general here so bear with me. I've spent a decent amount of time attempting to figure out this problem and I just can't find a solution.
...

**8**

votes

**3**answers

833 views

### On maximal regular polyhedra inscribed in a regular polyhedron

Let T, C, O, D, or I be regular tetrahedron, cube, octahedron, dodecahedron, and icosahedron, respectively. Suppose that the outer polyhedron have edge-length 1.
For example, it's easy to prove that ...

**10**

votes

**2**answers

233 views

### Do maximal polyhedra have algebraic volume?

Is it possible to prove that for every $n > 3$ the maximal possible volume of a convex polyhedron having $n$ vertices inscribed in a sphere of unit radius is an algebraic number?
Update: What ...

**2**

votes

**1**answer

167 views

### Equiprojective polyhedra

Seeing Garabed Gulbenkian's question (which was inspired by Joel Hamkins' question), reminds me of an analogous problem which I believe remains open,
and which some might find intriguing.
Define an ...

**5**

votes

**1**answer

316 views

### Standard (special) spines and hyperbolic structure on 3-manifolds

My question relates to constructing angled triangulations or hyperbolic triangulations for $3$--manifolds. Briefly, an angle triangulation can be considered as an assignment of a real number (called ...

**2**

votes

**0**answers

93 views

### Criteria to decide whether a subset of the boundary complex of a polyhedron is a manifold?

Let $\mathcal{P} \subseteq \mathbb{R}^d$ be a convex polyhedron. Let $K$ be a subset of the boundary complex of $\mathcal{P}$. (Perhaps $K$ could be defined in terms of a system of linear ...

**9**

votes

**1**answer

313 views

### Complexity of the union of randomly rotated unit cubes

It is a remarkable fact that the union of congrent cubes
has only at most near-quadratic combinatorial complexity,
$O^*(n^2)$ for $n$ cubes, known to be almost tight.
This contrasts with the union of ...

**7**

votes

**2**answers

235 views

### Volumes of convex vs non-convex polyhedra with prescribed facets areas

It is known that given a set of Areas $A_f$ and normals $\vec{n}_f$ if $\sum_f A_f \vec{n}_f=0$ exist a unique convex polyhedron with given face areas and normals. (Minkowski theorem - See Alexandrov ...

**24**

votes

**2**answers

1k views

### Can the unsolvability of quintics be seen in the geometry of the icosahedron?

Q1. Is it possible to somehow "see" the unsolvability of quintic polynomials
in the $A_5$ symmetries of the icosahedron (or dodecahedron)?
Perhaps this is too vague a question.
Q2. Are there ...

**2**

votes

**1**answer

588 views

### non-convex Polytope definition

I have a simple question. I read that given a vector space $N_{\mathbb{R}}$ over $\mathbb{R}$,
we can define a convex polytope in the following way:
$$P:= \Big\{ \sum_{u\in S} \mu_u u \,\Big| \, ...

**15**

votes

**1**answer

372 views

### Does every convex polyhedron have a combinatorially isomorphic counterpart whose all faces have rational areas?

Does every convex polyhedron have a combinatorially isomorphic counterpart whose faces all have rational areas?
Does every convex polyhedron have a combinatorially isomorphic counterpart whose edges ...

**2**

votes

**2**answers

520 views

### Polyhedra Classification

The following is inspired by this question. From time to time I search the web for tables of polyhedra, but without much success. Part of the problem is that there are many non-equivalent questions ...

**8**

votes

**3**answers

830 views

### Solid angles of a tetrahedron

This is a problem I have had for a while. For a triangle, the side opposite the largest angle has the largest length (and similarly for smallest angle). For a tetrahedron, the question is whether the ...

**0**

votes

**0**answers

119 views

### Convex Polyhedra with Largest Constant Dihedral Angle for Given Number of Faces

Which $20$ faced convex polyhedron has the largest constant dihedral angle?
Which $24$ faced convex polyhedron has the largest constant dihedral angle?
Also, what about $30$ or $32$ faced polyhedra? ...

**5**

votes

**5**answers

750 views

### Visualizing polyhedra from their 1-skeletons

Except for a few simple cases (typically pyramids and prisms) I find it hard to visualize a polyhedron from its 1-skeleton embedded in the plane, e.g. the hexahedral graph 5, as can be seen here.
...

**8**

votes

**1**answer

449 views

### Polyhedra that combinatorially shadow a sequence

Let $P$ be a polyhedron in $\mathbb{R}^3$.
Say that $P$ combinatorially shadows a sequence of natural numbers $S$ if
there is a continuous rotation of $P$ such that its orthogonal-projection
shadows ...

**14**

votes

**2**answers

931 views

### Is the tensor product of polyhedra a polyhedron?

Conventions: A polytope in a finite-dimensional $\mathbb R$-vector space $V$ is defined to be a convex hull of finitely many points in $V$. A polyhedron in a finite-dimensional $\mathbb R$-vector ...

**2**

votes

**2**answers

633 views

### Dilogarithm, tetrahedrons, and hyperbolic space

The Bloch-Wigner function $D(z)$, gives the volume of a ideal tetrahedron in hyperbolic space $\mathbb H3$, where z is the cross-ratio (z1,z2,z3,z4) parametrizing the tetrahedron in $\mathbb CP1$.
...

**2**

votes

**2**answers

331 views

### Surface of a Ideal Tetrahedron in Hyperbolic Space H3

The hyperbolic space $\mathbb{H}^3$, has a boundary $\mathbb{CP}^1$.
A ideal tetrahedron in $\mathbb{H}^3$, is a tetrahedron, where the four vertices are on the boundary $\mathbb{CP}^1$.
The four ...

**1**

vote

**2**answers

657 views

### Does Euler's formula imply bounds on the degree of vertices in a 3-polytopal graph?

A corollary of Euler's formula tells us that the edge-vertex graph of every convex 3-polyhedron must have a face with either 3, 4, or 5 edges, using an argument about the average degree of vertices.
...

**2**

votes

**1**answer

143 views

### coarser than triangulations “almost partitions” into simplices

The total space $T$ of an embedded into $\mathbb{R}^n$ pure $n$-dimensional simplicial complex (in other words, the union of finitely many $n$-dimensional compact convex polytopes) sometimes admits an ...

**7**

votes

**1**answer

474 views

### Wrapping a convex polyhedron with string

This is a meta-question, rather than a specific mathematical question.
I am seeking a mathematical definition that captures the following physical idea.
Suppose you have a convex polyhedron $P ...

**2**

votes

**1**answer

156 views

### How can pushing a vertex in a polytope lead to merging facets?

I'm trying to understand the Lemma 2.2 and Corollary 2.3 of Francisco Santos paper "A counterexample to the Hirsch conjecture": http://arxiv.org/abs/1006.2814
Corollary 2.3 is a proof of a result of ...

**21**

votes

**1**answer

1k views

### Building a genus-$n$ torus from cubes

I wonder if this has been studied:
What is the fewest number of unit cubes
from which one can build an $n$-toroid?
The cubes must be glued face-to-face,
and the boundary of the resulting ...

**8**

votes

**2**answers

768 views

### Fractal Tiling of Rhombic Dodecahedra

Hello, this is my first question on Math Overflow...
Rhombic dodecahedra can be tiled in 3-space, leaving no gaps. This tiling corresponds to the close-packing of spheres.
Consider a "nucleus" ...

**3**

votes

**1**answer

275 views

### Grading a non-graded poset as squeezed as possible

Here is a curiosity question (motivated by the recent revamp of ranked-poset routines in Sage).
Let $P$ be a finite poset. We look for a family $\left(a_p\right)_{p\in P}$ of real numbers summing up ...

**9**

votes

**1**answer

1k views

### What nets fold to polyhedra?

There is a classic (and open) problem asking whether every polyhedron can be unfolded to give a non-overlapping net. The converse problem has been studied asking which polygons can be folded in some ...

**11**

votes

**2**answers

343 views

### Acute triangulation

Assume that $S$ is a finite 2-dimensional simplicial complex equipped with a metric $d$
such that each triangle is isometric to a plane triangle (so $(S,d)$ is a polyhedral space).
Is it possible ...

**6**

votes

**0**answers

347 views

### Maximum volume convex body coverable by a unit square

Suppose you are given a single unit square, and you are permitted to cut it into $k$ (connected)
pieces (where $k=1$ means just the square). Your task is to construct the largest volume
convex body ...

**8**

votes

**3**answers

664 views

### Efficient topological triangulations of non-convex polyhedra

Does every polyhedron in $\mathbb{R}^3$ with $n$ triangular facets have a topological triangulation with complexity $O(n)$?
Suppose $P$ is a non-convex polyhedron in $\mathbb{R}^3$ with $n$ ...

**19**

votes

**1**answer

465 views

### Update to Shephard's “Twenty Problems on Convex Polyhedra”

Forty-three years ago, Geoffrey Shephard published an influential list of open problems
on convex polyhedra.
Progress has been made on several of his problems, and perhaps some have been completely ...

**4**

votes

**3**answers

626 views

### Number of Hyper-cube cuts

In how many ways a single hyperplane can cut a hypercube? Two "ways" are considered different, if the sets into which they divide vertices of the hypercube are different. So e.g. a line can cut ...

**3**

votes

**1**answer

247 views

### On Dehn's infinitesimal rigidity theorem

Dehn's theorem states that any simplicial strictly convex polyedron P in Euclidean 3-space is infinitesimally rigid (that is, any non-trivial first order deformation of P induces a variation of its ...

**13**

votes

**2**answers

2k views

### How many vertices/edges/faces at most for a convex polyhedron that tiles space?

I wonder if this problem has already been examined before:
Consider a convex polyhedron that tiles $\mathbb R^3$. What is the maximum of vertices/edges/faces that such a polyhedron can have?
...

**17**

votes

**2**answers

833 views

### Placing points on a sphere so that no 3 lie close to the same plane

Motivation
I am working with arbitrary parallelopiped tilings given by projection from a higher dimensional space. The collection of tiles, and some properties of the higher dimensional space are ...

**5**

votes

**2**answers

236 views

### What is the smallest diameter ring a non-convex polyhedron can pass through in 3-space?

The question is mostly in the title:
What is the smallest diameter ring a non-convex polyhedron can pass through in 3-space?
Imagine I have some non-convex polyhedron $P$, and I would like to ...

**9**

votes

**2**answers

472 views

### When does every point in a polytope lie along a chord between its edges?

Consider the 3-simplex, or tetrahedron, in 3-space. Regardless of the positions of the vertices, every point in the simplex lies on a chord between two non-adjacent edges of the simplex. Or, ...

**7**

votes

**3**answers

677 views

### Not quite regular polyhedra

Take a naive interpretation of regular polyhedra:
All vertices (including epsilon ball) congruent
All edges congruent
All faces congruent
We can now find interesting families by removing one ...

**4**

votes

**1**answer

2k views

### intersection of convex and non-convex polyhedra

Hi everyone,
I am trying to find the best appropriate way to intersect polyhedra which may be non-convex.
The number of vertices that build the polyhedron is hence always small (up to 20 or so).
...

**7**

votes

**3**answers

2k views

### polyhedra with equilateral pentagons faces.

In page http://loki3.com/poly/isohedra.html around six polyhedra with equilateral pentagons as faces are shown: a pyritohedron, icositetrahedrons... Is there a complete list of this kind of polyhedra? ...

**4**

votes

**1**answer

401 views

### Are there non-tiling polyhedra that pack arbitrarily well?

The fact that an upper bound on the packing density $< 1$ has only recently been exhibited for regular tetrahedra in $\mathbb{R}^3$ (see this question) suggests that proving concrete bounds of ...

**34**

votes

**1**answer

2k views

### Pach's “Animals”: What if the genus is positive?

Janos Pach asked a deep question 23 years ago (1988) that remains unsolved today:
Can every animal—a topological ball in $\mathbb{R^3}$ composed of unit cubes glued face-to-face—be ...