The polyhedra tag has no wiki summary.
5
votes
0answers
122 views
3D models of the unfoldings of the hypercube?
There are (apparently) 261 distinct unfoldings of the 4D hypercube, a.k.a., the
tesseract, into 3D.1
These unfoldings (or "nets") are analogous to the 11 unfoldings of
the 3D cube into the plane.2
...
0
votes
0answers
40 views
Number of faces of polytope projecting to lower dimensional polyhedron
Denote $K=\mathrm{conv}(v_1, \ldots, v_n)\subsetneq\Bbb R^m$ to be convex set spanned by vectors $v_i\in\Bbb R^m$ with $m\leq n$ then what technique could be useful to upper bound minimum number of ...
5
votes
1answer
301 views
Examples of Polyhedra with Large Shadows
Let $P \subseteq \mathbb{R}^n$ be a polyhedron described by $\mathcal{O}(n^{c_1})$ inequalities, where $c_1$ is a constant. Moreover, let $M\colon P \to \mathbb{R}^2$ be a linear mapping. I'm looking ...
14
votes
4answers
426 views
The limit of edge-midpoint convex polyhedra
Starting with a convex polyhedron $P_1 \subset \mathbb{R}^3$,
replace that with $P_2$, the convex hull of the midpoints of the edges of $P_1$.
Continuing this process, we obtain a ...
3
votes
1answer
78 views
How to approximate volumes of m-dimensional manifolds with m-dimensional polyhedra
The areas of a sequence of polyhedra approaching a surface need not approach the area of the surface, but there are theorems guaranteeing that this be so. (T. Rado, On the Problem of Plateau, Chapter ...
15
votes
1answer
237 views
Higher dimensional generalization of: Any quadrilateral tiles the plane?
Any (non-self-intersecting) quadrilateral tiles the plane.
(MathWorld image.)
Q. What is the strongest known generalization of this statement to higher dimensions?
I.e., ...
3
votes
1answer
134 views
$\mathcal{H}$-polyhedron under a linear map
Let $P = \{ x \in \mathbb{R}^n \mid Ax \leq b \}$ be a (bounded) polyhedron for $A \in \mathbb{R}^{m \times n}$ and $b \in \mathbb{R}^m$, $n,m > 0$.
Moreover, let $M \colon \mathbb{R}^n \to ...
4
votes
2answers
157 views
Build a topological polytope with a specified CW-structure
I am a topologist and not quite familiar with the tools for building a polytope. I would like to build some topological polytope which is an somewhere in between permutohedron and associahedron which ...
4
votes
3answers
215 views
Can anyone suggest a text on polyhedral theory?
Can anyone suggest a text on polyhedral theory? Particularly on increasing the number of faces under projections. 0,1 polytopes
5
votes
2answers
236 views
Put P inside Q! polygons/polyhedra
We have two Polygons/Polyhedra P and Q.
Does there exist a polynomial time algorithm to decide if we can put P (using translation and rotation) inside Q or not?
First think about the case of which P ...
10
votes
2answers
502 views
Cut and Fold Polyhedron!
I have two convex polyhedra such that their sums of side areas are equal. It is true that I can cut one of them and flatten it on the plane, then fold the flattened polygon to reach the other ...
8
votes
1answer
429 views
Polyhedron not circumscribed about a sphere
Let $P$ be a polyhedron whose faces are colored black and white so that there are more black faces and no two black faces are adjacent. Show that $P$ is not circumscribed about a sphere.
My teacher ...
4
votes
1answer
180 views
Light inside a polyhedron
I have two questions the same as Mostafa's Question:
Visibility of vertices in polyhedra
Suppose $P$ is a closed polyhedron in space (i.e. a union of polygons which is homeomorphic to $S^2$) and $X$ ...
20
votes
3answers
826 views
Visibility of vertices in polyhedra
Suppose $P$ is a closed polyhedron in space (i.e. a union of polygons which is homeomorphic to $S^2$) and $X$ is an interior point of $P$. Is it true that $X$ can see at least one vertex of $P$? More ...
13
votes
0answers
346 views
Surface area of convex hull [duplicate]
Let Q be the convex hull of a non-convex polyhedron P. Is it true that the surface area of Q is not greater than the surface area of P?
3
votes
2answers
50 views
Enumerating Tri-vertex transitive polyhedra n > 3 faces
How many unique vertex transitive polyhedra exist where each vertex has 3 incident edges
for polyhedra with n (= # faces) > 3 ?
13
votes
2answers
566 views
What was the Question that led Euler to his Investigations on Polyhedra?
The question that led Euler to his investigations on graphs is the well-known question related to the seven bridges of Königsberg, and that story is a must in every introduction to graph theory.
...
4
votes
0answers
156 views
Regular cross-sections of a dodecahedron; analogous sections of 4-polytopes
One can intersect a dodecahedron with a plane and
obtain an equilateral triangle, a square, a regular pentagon,
a regular hexagon, and a regular decagon:
...
10
votes
0answers
659 views
Making a convex polyhedron with two sheets of paper
Suppose that we have two sheets of paper $S,T$ and that each of $S,T$ is in the shape of a convex quadrilateral. Also, suppose that the length of the perimeter of $S$ equals that of $T$. (Note that ...
2
votes
1answer
41 views
Seeking criteria for “threadable” pairs of centrosymmetric polyhedra
Let $A$ and $B$ be origin-centered centrosymmetric polyhedra in $\mathbb{R}^3$:
"for every point $(x, y, z)$ [...] there is an indistinguishable point $(-x, -y, -z)$."
Say that $A$ and $B$ are ...
2
votes
0answers
91 views
Convex polyhedra jammed in $k$ disjoint holes
For a given convex polyhedron $P \subset \mathbb{R}^3$,
I was imagining finding the optimal "fixing" of $P$ in holes (or jamming them in "mud"),
which led to the following question.
First, scale $P$ ...
29
votes
3answers
3k views
Did ancient mathematicians know Euler's characteristic for convex polyhedra?
The formula $V-E+F=2$ is so simple that I can't believe that it was really Euler (or perhaps Descartes) who first observed it (I mean the formula itself in some generality, not necessarily a valid ...
4
votes
1answer
77 views
Polyhedra with minimal edge length
Given a fixed volume and fixed surface area I would like to construct polyhedra that minimize the total length of the edges. This seems like a straight-forward problem to solve by brute force for ...
16
votes
2answers
541 views
“Derived” polyhedra and polytopes
The notion of derived polygon is natural and leads to remarkable convergence.
Start with a polygon, and replace it by locating a point on every edge
a fraction $\alpha$ between the two endpoints. For ...
7
votes
0answers
111 views
Does every convex polyhedron have a combinatorially isomorphic counterpart whose angles between edges are rational multiples of $\pi$?
After reading these very interesting questions, I came up with another one:
Does every convex polyhedron have a combinatorially isomorphic counterpart whose angles between all pairs of edges meeting ...
8
votes
1answer
134 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
0answers
77 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 ...
26
votes
3answers
996 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}$.
...
0
votes
1answer
96 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 ...
5
votes
1answer
134 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
3answers
550 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 ...
7
votes
0answers
208 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 ...
3
votes
0answers
134 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 ...
2
votes
1answer
382 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
3answers
695 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 ...
9
votes
2answers
215 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
1answer
150 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
1answer
255 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
0answers
78 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
1answer
277 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 ...
6
votes
2answers
206 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 ...
1
vote
1answer
275 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
1answer
351 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
2answers
380 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
3answers
566 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
0answers
87 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? ...
4
votes
3answers
547 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
1answer
388 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 ...
10
votes
2answers
798 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
2answers
467 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$.
...
