Tagged Questions

Questions related to polyhedra and their properties.

learn more… | top users | synonyms

1
vote
0answers
31 views

Determining the set of a linear transformation of elements in a polyhedron

I have a set defined by linear inequalities of the form: $X = \{x : Ax \le b\}$. For any $x \in X$, I write $y = Gx$ where $G$ is a matrix (the dimension of $y$ is less than the dimension of $x$). ...
0
votes
1answer
19 views

Prove that a convex $d$-polytope has at least $d+1$ facets

This seems trivial but I can't come up with a formal proof. I think there should be a way to do this inductively but I can't figure out how$\ldots$ Any help much appreciated
1
vote
2answers
61 views

Why does induction procedure of Euler characteristic fail for non-convex polyhedra? What am I missing?

Euler characteristic of convex polyhedra is always $V-E+F=2$. Induction procedure reduces edges and vertices until we are down to one vertex whose $V-E+F=2$ and hence you are done. The same ...
0
votes
1answer
16 views

Proof: Minkowski sum polytope implies A and B polytopes

Suppose $A$ and $B$ are convex sets and their Minkowski sum $A+B$ is a polytope. How do you prove that $A$ and $B$ are polytopes as well?
0
votes
0answers
15 views

Maximization over linear surjective mapping of polyhedron

I am reading this paper and confused about the derivation of equation (11) (page 3, bottom of column 2). I will rephrase it in this question. Let $\mathcal{P}_r = \{ x \in \mathbb{R}^n : P_r x \leq ...
3
votes
1answer
23 views

Have face-transitive polyhedra been completely classified?

I've been researching polyhedral dice, and everywhere I look it states that face-transitive (and therefore fair) dice include polyhedra of various families, like the platonic solids, catalan solids, ...
11
votes
1answer
115 views

Largest $n$-vertex polyhedron that fits into a unit sphere

In two dimensions, it is not hard to see that the $n$-vertex polygon of maximum area that fits into a unit circle is the regular $n$-gon whose vertices lie on the circle: For any other vertex ...
2
votes
0answers
18 views

Does every polyhedral graph have a path cover with non-empty paths?

I'm looking to prove or disprove the following conjecture: Every polyhedral graph has a path cover with vertex disjoint, non-zero (length $\ge 1$) paths. Any pointers to literature are appreciated. ...
1
vote
0answers
23 views

On the Name of the Amplituhedron

Shouldn't the 'amplituhedron' really be called an 'amplitutope' since it's really a polytope and not strictly a polyhedron?
0
votes
0answers
14 views

A Geometry Terminology Question

Edges and diagonals are to polygons as faces and X are to polyhedrons? What is the answer to X? I've been touching up on geometry and I'm having trouble finding an answer to this, and inconsistency ...
0
votes
2answers
23 views

Configuration of five or more mutually equidistant points in space.

How is it proved that there is no configuration of five or more mutually equidistant points in $R^3$? Is it done by induction? I'm stuck. Help would be appreciated. Well, surely equilateral ...
0
votes
0answers
24 views

How is the Uniqueness of Equilateral Tetrahedra Proved? [duplicate]

Equilateral tetrahedrons all have this property: For any two of its vertices exists a third vertex, which forms an equilateral triangle with these 2 vertices. (It doesn't necessarily have to be a ...
1
vote
0answers
54 views

Minkowski sum of two polytopes via the halfspace representation

If i have two polytopes denoted by $P_1, P_2 \subset \mathbb{R}^d$, suppose their halfspace representations are respectively $H_1x \leq K_1$ and $H_2x \leq K_2$. Now, considering their Minkowski sum, ...
1
vote
0answers
17 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
28 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
20 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
28 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 ...
1
vote
0answers
104 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
35 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 ...
0
votes
0answers
31 views

How many arrangements (correct and incorrect) possible with cube puzzle pieces in a particular unfolded form?

I am trying to do a computer program for arranging cube puzzle pieces in an unfolded form. A cube can be unfolded into 11 forms or nets. I have chosen a single net for now for simplicity purposes and ...
0
votes
0answers
14 views

Explanation regarding Kaleido index for polyhedra

I can't seem to find any information about the Kaleido index number used in geometry (see 'K# at http://en.wikipedia.org/wiki/List_of_Wenninger_polyhedron_model'). I found an abstract called "Uniform ...
1
vote
0answers
54 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
43 views

Symbols to represent each distinct symmetry of polyhedra

Is there a pictorial or symbolic way to represent each distinct symmetry of a polyhedron?
1
vote
1answer
56 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
52 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 ...
0
votes
0answers
13 views

For an app teaching about polyhedra, what are some core characteristics to include?

For fun: I'm building a 3d app that teaches about polyhedra. What should I include? The obvious didactic elements for each polyhedron would be: Fundamental polygon's Vertices 
Edges
 Faces
 (and ...
7
votes
1answer
124 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 \ ...
0
votes
0answers
37 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
58 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 ...
0
votes
0answers
34 views

Is there a nice characterization of circumscribed hexahedra?

A convex quadrilateral that contains a circle tangent to its sides is called a tangential or circumscribed quadrilateral. There is a very nice characterization of tangential quadrilaterals known as ...
2
votes
0answers
61 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
55 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
26 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
42 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
73 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
28 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
48 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
46 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
97 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 ...
3
votes
1answer
34 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
50 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
28 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 ...
0
votes
0answers
31 views

Dual of a polyhedra vs. dual of an optimalization problem

There are lot of fields where the term duality appear. Is there any relationship between dual of an optimalization problem and dual of a polyhedra?
4
votes
2answers
90 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
4answers
77 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 ...
3
votes
0answers
31 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
19 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
40 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
39 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
38 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 ...