Questions related to polyhedra and their properties.

learn more… | top users | synonyms

1
vote
0answers
42 views

Folding a Given Net into a Polyhedron Automatically!

There are some applications to fold predefined nets into the polyhedra, e.g. "Poly" or this applet. Is there any application which automatically folds any net generated by the user, if possible?
1
vote
1answer
37 views

Find volume of parallelepiped where all faces are rhombuses with edge $a$ and angle $60^\circ$.

Find volume of parallelepiped where all faces are rhombuses with edge $a$ and angle $60^\circ$. I first noticed that $\dfrac{h}a=\sin60^\circ$, so I easly found that height of the rhombus is ...
2
votes
0answers
36 views

Create Platonic solids from the coxeter group (vertexes & edges & faces)

How can one define vertexes, edges and faces from the Coxeter group? For example, for all platonic solids? I would like to create a general function that takes the Coxeter diagram as input, and gives ...
2
votes
0answers
40 views

Discrete Analogue of the Poincaré Conjecture and Simple Connectedness

I apologize if this question is badly worded or obvious, but I have no formal topology background. I have put some effort into trying to find something, but nothing turned up, perhaps due to my lack ...
2
votes
1answer
288 views

Show that every extreme point in Q is either an extreme point of P or a convex combination of two adjacent extreme points of P

P is a bounded polyhedron in $\mathbb{R}^n$, $a$ a vector in $\mathbb{R}^n$, and $b$ some scalar. Define $$Q = {x \in P | a'x = b}$$. Show that every extreme point in Q is either an extreme point of P ...
0
votes
0answers
46 views

Vertices of Polyhedral

Suppose there are matrix $A\in\mathbb{R}^{n \times m}$ and vector $b\in\mathbb{R}^n$. Consider a non-empty polyhedron $P = \{Ax \leq b\} $. Then, there exists a vector $\bar{x}\in P $ such that ...
1
vote
0answers
128 views

Linear programming - Textbook recommendations

Next term, I will attend a course on linear programming. Due to the assignments, we will have to write many thorough proofs. I anticipate that we will be supposed to cope with in-depth background ...
5
votes
0answers
125 views

Symbols to represent each distinct symmetry of polyhedra

Is there a pictorial or symbolic way to represent each distinct symmetry of a polyhedron?
2
votes
1answer
83 views

Visualizing Platonic Solid group symmetries

How do you visualize the rotation symmetries, to classify a icosahedron for example as Ih, H3, [5,3], (*532)
2
votes
0answers
277 views

Drawing a Truncated Octahedron

I'm trying to draw a truncated octahedron in MATLAB. This is also known as a permutahedron so my strategy is to link up all the vertices via adjacent transpositions of permutations in $S_4$. What I ...
7
votes
1answer
170 views

Showing that group of orientation preserving isometries of Icosahedron is a simple group

Let $G$ denote the group of orientation preserving isometries of Icosahedron. To prove the claim, I have shown that $\nexists \ N \ \triangleleft \ G$ such that $|N|=5.$ $\nexists \ N \ ...
1
vote
1answer
114 views

How to locate sphere resting in a corner of a polyhedron?

I am working on an interface to a computational solid geometry program. I would like this program to be able to fillet corners (although fillet sometimes seems to refer to an internally smoothed ...
3
votes
1answer
91 views

Show that Icosahedral group does not have normal subgroup of order 5

Here is my work so far: Let $G$ denote the group of orientation-preserving isometries of Icosahedron. I have shown that $G$ acts transitively on $G/G_s$ where $G_s$ is the isotropy group, namely ...
2
votes
0answers
71 views

Number of faces of a polytopal subdivision

Let $\mathcal{P}$ be a (bounded) polytope in $\mathbb{R}^d$ and let $\mathcal{C}$ be a polytopal subdivision of $\mathcal{P}$ [1]. Is there a known tight upper bound in the number of polytopes in ...
2
votes
2answers
221 views

Maximum number of vertices in intersection of triangle with box

Suppose we have a triangle and a box in 3D. The intersection of the triangle with the (solid) box will be a polygon with some number of vertices (possibly zero). The vertex count will vary according ...
0
votes
2answers
43 views

LP: An algorithm to decide whether a polyhedron is a subst of another polyhedron

I've encountered the following question which I am unable to solve: $$ P = \{\vec x | A\vec x \geq \vec a\} \\ Q = \{\vec x | B\vec x \geq \vec b\}\\ P, Q \subseteq R^n $$ Find an algorithm to ...
1
vote
1answer
65 views

a general definition of the volume of a high dimensional polytope

I would like to find a general definition of the volume for a full dimensional polytope in $R^n$. Could anyone give me a hint please! Thank a lot
1
vote
1answer
178 views

Why is the 24-cell (also called Icositetrachoron or Hyperdiamond) the unique regular convex polychoron which has no direct three-dimensional analog?

The 24-cell is self-dual, and is the unique regular convex polychoron which has no direct three-dimensional analog. http://mathworld.wolfram.com/24-Cell.html I don't understand why that is ...
2
votes
1answer
53 views

Time to roll through subterranean chords

Imagine a spherical airless body. It is small enough that central pressure allows a tunnel to be built from north pole to the south pole. I jump in the tunnel at the north pole and fall to the south ...
0
votes
1answer
81 views

If we inscribed all the 6 regular convex four-dimensional polytopes in a sphere, which one would have the highest volume?

When a dodecahedron is inscribed in a sphere, it occupies more of the sphere's volume (66.49%) than an icosahedron inscribed in the same sphere (60.54%). But what about for the 6 regular convex ...
0
votes
1answer
185 views

What are the formulas for the number of vertices, edges, faces, cells, 4-faces, …, $n$-faces, of convex regular polytopes in $n \geq 5$ dimensions?

I know that in dimension $n \geq 5$ there are only 3 kind of convex regular polytopes in each dimension: the $n$-simplex, the $n$-cube and the $n$-orthoplex. I would like to know if there are ...
2
votes
1answer
177 views

Which polyhedron has 17 vertices, 34 edges and 19 faces?

on exam I had task to check that there is polyhedron with 8 triangle faces, 11 quadrangle, each vertices have degree 4. after calculate I obtain that it have 34 edges, 17 vertices and 19 faces but i ...
4
votes
3answers
177 views

Volume of overlap between two convex polyhedra

I have two convex polyhedra represented by triangle meshes. I can easily determine if they are in contact or not, but when they are in contact then I would like to determine the volume of their ...
1
vote
1answer
87 views

Minimum distance of extreme points of polyhedra

Let $P = \{x \in \mathbb{R}_{\geq0}^n \colon Ax \leq b\}$ with $A \in \mathbb{R}^{m \times n}$ and $b \in \mathbb{R^m}$. Let $E \subseteq P$ be the extreme points of $P$. Can anything be said about ...
2
votes
1answer
40 views

what is and how to generate a Net representation for a given polyhedron?

The so called Net representation for a Tetrahedron is depicted in the following image ( link to wolfram ) : What is this for ? How to reason about this and how to generate this very same ...
5
votes
2answers
154 views

Why are polyhedra related to the prime numbers 2, 3 and 5, but not to the prime number 7?

Just take a quick glance at all the numbers in these Wikipedia pages on polyhedra: http://en.wikipedia.org/wiki/Platonic_solid http://en.wikipedia.org/wiki/Archimedean_solid ...
0
votes
7answers
238 views

there is any relation between $\pi$, $\sqrt{2}$ or a generic polygon?

I'm a programmer, I'm always looking for new formulas and new way of computing things, to satisfy my curiosity I would like to know if there are any formulas, or I should say equalities, that make use ...
4
votes
1answer
70 views

Convex Polyhedron problem

I want to prove it isn't possible to make a football (a convex polyhedron such that at least 3 edges meet at each vertex) out of exactly 9 squares and m octagons where $m>3$.
1
vote
1answer
36 views

How do you know at least one face is not simply connected on a polyhedra?

if it has 14 vertices, 21 edges and 9 faces, its boundary is a single surface and there is at least one hole. I dont understand.
1
vote
0answers
87 views

Proof that a Polytope has vertices

As part of my Discrete Optimization course, I have a homework where I have to prove that a Polytope has vertices. I seems to have all tools in hand (definition of a vertex, polytop, convex hull, etc.) ...
1
vote
1answer
46 views

Counting polyhedra

Given $n>6$ points in space are placed in such a way that no three are collinear and no four lie on the same plane. Show number of convex polyhedra with $5$ faces and vertices among the given ...
0
votes
1answer
42 views

Could someone explain me this induction.

I'm trying to understand a paper called "Diameter of Polyhedra: Limits of Abstraction" available here : http://sma.epfl.ch/~eisenbra/Publications/designs.pdf My problem is with the first two ...
2
votes
0answers
19 views

The process of alternation on an n-polytope

I am currently working on a problem involving algebraic geometry and as a part of the research it would be helpful for me to understand the process of alternation, also called partial truncation, ...
1
vote
0answers
53 views

Generalized permutahedron and random polytopes

The Birkhoff polytope $B_n$ is defined as the convex hull of the set of permutation matrices, which gives us the set of doubly stochastic matrices. A concept which is intimately related is that of the ...
1
vote
1answer
117 views

Formula for greatest cross section of regular dodecahedron

Is there a formula for the area of greatest cross section of a regular dodecahedron? For example, this can be viewed as finding a hole big enough for it to fit into.
3
votes
5answers
417 views

Is the rhombic dodecahedron the only isohedral polyhedron that tiles 3-space (other than the cube)?

Is the rhombic dodecahedron the only face-transitive (or isohedral, i.e. all faces are the same) polyhedron that seamlessly tiles 3-dimensional Euclidean space (other than the cube)? I'm looking ...
2
votes
1answer
147 views

Three theorems for Polyhedra, Polytopes, and Cones

Are there readable proofs of the following theorems? A polytope (bounded polyhedron) is the convex hull of a finite set of points. A polyhedral cone is generated by a finite set of vectors. That is ...
28
votes
2answers
977 views

What is the Coxeter diagram for?

I understand that Coxeter diagrams are supposed to communicate something about the structure of symmetry groups of polyhedra, but I am baffled about what that something is, or why the Coxeter ...
3
votes
3answers
96 views

Polyhedra having equal quadrilateral faces are cubes?

While discussing with my 11 y.o. daughter about the definition of a cube as regular hexahedron, I observed that actually we can let drop the assumption that the faces are squares, and require only ...
1
vote
1answer
55 views

showing that all convex polehedron graphs are 3-connected

I'm trying to figure out how to show that two nonadjacent vertices in the graph of a convex polyhedron can be disconnected from one another by the removal of at least three vertices. I know what a ...
2
votes
2answers
68 views

Is this a polyhedron?

Is $S$ a polyhedron? $$S=\{x\in\mathbb{R}^n|\|x-x_0\|\le\|x-x_1\|\}$$ where $x_0, x_1$ are given. $S$ is the set of points that are closer to $x_0$ than to $x_1$. I was thinking the ...
2
votes
1answer
49 views

Showing that this family of vectors generates $\mathbb{R}^n$

Suppose that: $$\{x\in\mathbb{R}^n\mid a_i^Tx\le b_i, i=1,2,\dots,m\}=\{x\in\mathbb{R}^n\mid g_j^Tx\le h_j, j=1,2,\dots,k\}$$ How can I show that if the vectors $a_1,\dots,a_m$ span $\mathbb{R}^n$ ...
0
votes
0answers
59 views

How to name/call this polyhedron?

How to name/call this polyhedron? What's a general method for finding the scientific name of a polyhedron?
0
votes
1answer
109 views

Polyhedron's Representations and spanning the Euclidian space

Let's say you have to different representations of the same polyhedron $P\neq \emptyset$: $$P=\{x\in \mathbb{R}^n\;|\;h_i^Tx\leq c_i, i=1,...,k \} =\{x\in \mathbb{R}^n\;|\;g_j^Tx\leq d_i, j=1,...,l ...
1
vote
1answer
67 views

Proving faces of polyhedron

let $F(k)$ be the number of faces of a convex polyhedron with k edges how can we prove that $F(k) > 1$ for some $k$? I know Euler's Formula for Polyhedra: $V-E+F=2$, and $\sum k\,F(k) = 2E$. ...
3
votes
3answers
155 views

Does a polyhedron with 7 hexagons and 20 pentagons exist?

A beautiful polyhedron with 20 hexagons and 60 pentagons can be seen here: http://robertlovespi.wordpress.com/2013/11/03/a-polyhedron-with-80-faces/ . Euler formula and the corresponding Diophantine ...
2
votes
1answer
140 views

Does a polyhedron with 16 quadrilateral faces exist?

I have just seen here the picture of a polyhedron with 15 quadrilateral faces. In some lists of polyhedra a big variety of quadrilateral sides can be found (12, 13, 15, 18, 20,...) but the number 16 ...
14
votes
3answers
1k 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 ...
3
votes
2answers
135 views

Construct polyhedron from edge lengths

I'm interested in the following problem: I am given the combinatorial structure (vertices, edges, faces) and edge lengths of a polyhedron. From this I'd like to infer the vertex positions. Now, I ...
0
votes
0answers
40 views

traversing faces of a polyhedron Hamiltonian Tour?

I wanted to know if I could start at one point on an icosahedron and traverse to all the others sequentially without visiting any one twice, which I assume I could model as a Hamiltonian path in a ...