Questions related to polyhedra and their properties.

learn more… | top users | synonyms

0
votes
0answers
16 views

Do there exist brief formulas to describe multiple symmetric, platonic , prismatic polyhedra?

Mathematics resources give coordinates of special polyhedra by their coordinates. Is there a mathematical algorithm that can take an input number i.e. 4-5-5-10-12-24- and divide space in to various ...
0
votes
0answers
11 views

Is $S = \{ x\in\mathbb{R}^n | x\geq 0 x^Ty\leq 1 \forall y\text{ with } ||y||_2=1\}$ a polyhedra?

Is the set $S$ polyhedra? where $S = \{ x\in\mathbb{R}^n | x\geq 0 x^Ty\leq 1 \forall y\text{ with } ||y||_2=1\}$ The answer is : S is not a polyhedron. It is the intersection of the unit ball ...
3
votes
2answers
130 views

Insect eyes. Tiling spheres with hexagons - pentagons required as facet size decreases?

I’m an amateur naturalist and am fascinated with the underlying geometry of an insect eye primarily made of hexagonal facets. In particular, how the sphere surface is fully packed as the hexagons ...
4
votes
1answer
103 views

Faces of Polyhedra

I am starting to study convex geometry. Let $\mathcal{P}$ be a polyhedron in $\mathbb{R}^n$. I want to show that the face $\mathcal{F}'$ of a face $\mathcal{F}$ of $\mathcal{P}$ is still a face of ...
0
votes
1answer
33 views

Looking for polyhedra under two simple but stringent conditionts

I noticed usual polyhedra have some vertices joining exactly 3 edges or some triangular faces (or both). Out of curiosity I started wondering if there is a polyhedron with the following constrains: ...
2
votes
0answers
43 views

Center of mass of vertices without enumeration?

Given a $n$-dimensional convex polytope defined by $A x\leq b$ and $A_{eq} x = b_{eq}$, is there an efficient way to determine the average coordinates of all vertices without enumerating them? (As if ...
8
votes
1answer
160 views

The smallest 8 cubes to cover a regular tetrahedron

A regular tetrahedron $T$ of edge-length $\sqrt{2}$ fits inside a unit cube:                     (Image from MathWorld.) This means that $8$ ...
2
votes
1answer
32 views

About the interior of a polyhedron

Let us consider a polyhedron in $\mathbb{R}^n$ (in this context it must NOT be bounded) $\mathcal{P} = \{ x: A \cdot x \leq c\}$ for some matrix $A$. Let $\mathcal{I} = \{ x: A \cdot x < c\}$ be a ...
3
votes
1answer
86 views

The Rhombohedron

I am trying to model a rhombohedron (using Blender) as a first pass to building Dürer's solid so I am trying to calculate the (x,y,z) values for a given side length 'a' and angle 'theta' (starting ...
2
votes
0answers
48 views

Stellating the Octahedron

I have a few related questions and I'd be happy to get some help with any one of them. Is the stellation of a polyhedron generally a 'messy' affair that involves trimming away portions of the ...
3
votes
2answers
54 views

Faster Algorithms for Convex Hulls

I was interested in the following: Given two polyhedra $P_1, P_2$ specified in the form: $$ P_1 = {x : A_1x \le b_1 } $$ $$ P_2 = {x : A_2x \le b_2 } $$ Whereas $ x \in R^n$ and $b_1, b_2$ are ...
4
votes
4answers
72 views

trying to grasp disphenoid tetrahedral honeycomb, what are the dihedral angles?

What are the dihedral angles in a disphenoid with four identical triangles, each having one edge of length $2$ and two edges of length $\sqrt{3}$? Tried to look it up, but couldn't find it...
0
votes
2answers
150 views

How do you find redundant constraints for a feasible region?

I've found a few papers that deal with removing redundant inequality constraints for linear programs, but I'm only trying to find the non-redundant constraints that define a feasible region (i.e. I ...
0
votes
2answers
36 views

How many face we could make regular convex polyhedron

I want to tile the sphere as many face as possible. And I want every face be the same size and shape. Is it possible to generate more than 100 or 1000 faces of regular convex polyhedron?
0
votes
0answers
30 views

Show that the set $\{y_1a_1+y_2a_2: -1\le y_1,y_2\le 1\}$ is a polyhedron

Show that the set is a polyhedron and express it in the form: $S = \{Ax\leq b, Fx = g\}$, $S=\{y_1a_1+y_2a_2 | -1\leq y_1\leq 1, -1\leq y_2\leq 1\}$ where $a_1,a_2\in\mathbb{R}^n$ My attempt: A ...
0
votes
1answer
34 views

Polyhedral cone as conic hull of a finite set

I am reading notes on optimization and it was claimed that all polyhedral cones in $K\subseteq \mathbb{R}^n$ can be written Cone(R) where $R\subseteq \mathbb{R}^n$ is a finite set. That is, if K is a ...
0
votes
0answers
11 views

Inner construction of polyhedral set: cone part uniquely determined

The "inner construction" of a polyhedral set is: given $V,R\subseteq \mathbb{R}^n$, $|V|,|R|\in \mathbb{Z}^+$ (nonempty, finite), put $S:=Co(V)+Cone(R)$. It was claimed that Cone(R) is uniquely ...
0
votes
1answer
50 views

Regular polyhedra surface area [closed]

When I looked at an image of a regular octahedron, I found that its surface was composed of triangles. Then I looked at a regular icosahedron and this was the same case! Then I saw a regular ...
3
votes
2answers
175 views

What are the rules for a Tetartoid pentagon?

The tetartoid (also tetragonal pentagonal dodecahedron, pentagon-tritetrahedron, and tetrahedric pentagon dodecahedron) is a dodecahedron with chiral tetrahedral symmetry. It has twelve identical ...
1
vote
0answers
18 views

For polytopes, does union and linear transformation commute?

Given two (convex) polytopes $P_1$ and $P_2$ and a linear transformation $T$, is it true that: $$T(P_1 \cup P_2) = TP_1 \cup TP_2$$ What if $P_1$ and $P_2$ are not convex?
1
vote
1answer
96 views

The maximum of several affine functions is a polyhedral function

A function $f: \mathbb{R}^n \mapsto (-\infty,\infty]$ is polyhedral if its epigraph is a polyhedral, i.e. $$\text{epi}f=\{(x,t)\in \mathbb{R}^{n+1} | \ \ C\left( \begin{matrix} x\\ t \end{matrix} ...
1
vote
1answer
90 views

Small Stellated Dodecahedron, generating triangle vertices

I have been trying to draw a small stellated dodecahedron (would post an image if I had enough rep) using OpenGL, and would like to generate the vertices programmatically. I'm looking for a way to map ...
1
vote
1answer
81 views

Cubohemioctahedron

Am I missing something here? Do I see shapes differently than everyone else? A Cubohemioctahedron is cited to have a Euler characteristic of negative 2. This is because most texts say its 10 faces ...
1
vote
1answer
33 views

Linear Independence Proof using Rotation

I am attempting to prove that three axes of rotation are linearly independent and so form a basis for $\mathbb{R}^3$. I assert that given the fact that rotations about each axis involve no rotation ...
0
votes
0answers
56 views

The definition of face - in regard to polyhedral fans

Question: How is face defined rigorously for bullet point 2 below. Definition: A convex polyhedral fan, $F$, of polyhedral cones, all living in the same vector space, requires two things: If ...
1
vote
1answer
41 views

In an icosahedron subdivided n times, how can I find the coordinates of adjacent centroids?

I think it would be helpful to refer to this image when trying to follow my description: http://i.imgur.com/nRXQo3W.jpg (taken from http://experilous.com/1/blog/post/procedural-planet-generation). ...
1
vote
0answers
25 views

Polyhedral surface with infinitely many triangulations with same combinatorics

Is there an example of a polyhedral surface that has infinitely many triangulations with the same combinatorics?
3
votes
2answers
74 views

In linear programming, how to check whether a convex polyhedron is contained in another

Suppose we have two convex polyhedra $P_1=\{x\in \mathbb{R}^n \mid A_1 x \geq b_1 \}$ and $P_2=\{x\in \mathbb{R}^n \mid A_2 x \geq b_2 \}$ Is there a way to check whether $P_1 \subseteq P_2$? I was ...
1
vote
1answer
60 views

What is the depth of water above the prism?

I have been practising for a math competition and came across the following question: A fishtank with base $100\,\rm cm$by $200\,\rm cm$ and depth $100\,\rm cm$ contains water to a depth of ...
0
votes
1answer
28 views

Subvector and related subspace

This might be easier than I think, but I got stuck. Assume a vector $y=[y_1,\ldots,y_n]\in Y$, where $Y$ is a convex polyhedron. Assume a $k$-dimensional subvector of $y$, namely ...
4
votes
1answer
67 views

Geometric Representation of Quasidihedral Groups

I am going back through Dummit/Foote studying for a prelim and came across the 'quasidihedral' or 'semi-dihedral', group of order $2^n$, with presentation $\langle r,s \mid r^{2^{n-1}} = s^2 = 1, srs ...
4
votes
0answers
57 views

Isomorphism of divisors

Consider the cartier divisor group $CDiv_{T_{N}}(X_{\Sigma})$ defined on the fan $X_{\Sigma}$. I am having trouble proving the following assertion that there is a natural isomorphism ...
5
votes
2answers
150 views

Convex polyhedron and its Gauß-curvature

I am trying to prove: A convex polyhedron has positive Gauß-Curvature at every vertex. What we know: Gauß-Curvature at every vertex is given by $K(p) = 2\pi - \sum\limits_{\text{angle } ...
4
votes
1answer
84 views

Finding generators of toric ideals

Consider the affine toric variety $V \subset k^{5}$ parametrized by $$\Phi(s,t,u) = (s^{4},t^{4},u^{4},s^{8}u,t^{12}u^{3}) \in k^{5}$$ where k is an algebraically closed field of characteristic 2. ...
9
votes
1answer
112 views

$3\mathrm D$ Projection Of $4\mathrm D$ Polyhedron

Can someone identify this shape? I think it is a $3\mathrm D$ projection of $4\mathrm D$ polyhedron. The body in the center seems to be a truncated octahedron, so as the body in the middle. The ...
1
vote
0answers
64 views

How to determine the outward normal vector of a face of a hexahedron if the orientation (CW or CCW) of vertices of the face is unknown

Consider a single quadrilaterally-faced hexahedron. If given the co-ordinates of the vertices, $\mathbf{v}_i$, of a face in counter-clockwise orientation, I can compute the corresponding unit outward ...
0
votes
1answer
89 views

How to prove a point in a set is an extreme point of the set ?

Def: an extreme point of a set $K$ is the point that cannot be expresssed as a convex combination of other points in $K$. Apart from the definition, what else arguments can we use to prove that a ...
2
votes
0answers
27 views

Dinamically generate Goldberg polyhedra G(m,n)

In these pages the autor provided a lot of info about some Goldberg polyhedra (http://en.wikipedia.org/wiki/Goldberg_polyhedron): http://dmccooey.com/polyhedra/DualGeodesicIcosahedra.html ...
2
votes
1answer
68 views

polytope with 12 vertices and 48 edges

It seems like you can construct a polytope with 12 vertices, where each vertex connects to all the other vertices except 3. So there must be a totalt of 48 edges. (each of the 12 vertcies connects to ...
2
votes
0answers
104 views

What honeycomb has the highest volume to edge length ratio?

This question is analagous to the Kelvin Problem where the solution, the Weaire-Phelan Structure, has the highest volume to surface area ratio; however, the cell volume is compared to edge length ...
3
votes
1answer
56 views

What does an Euler characteristic of a topological space greater than 2 topologically mean?

Recently I've found a polyhedron with Euler characteristic $\chi=9$. This is made from the Octahemioctahedron with adding the intersections of the hexagon faces as vertices. It has $V=13, E=36, ...
4
votes
2answers
181 views

Why is Octahemioctahedron topologically a torus?

I'm afraid, that I have a very bad space vision, because I don't see, that Octahemioctahedron is topologically a torus. Could somebody explain it for me, why is it? Scene 2. @aes: Finally, ...
3
votes
1answer
116 views

Largest of the smallest angles of incidence from arbitrary point to tetrahedron vertex/centroid line

Picture a regular tetrahedron where each vertex has a line through the centroid and a plane normal to it. I need to show that the range of the smallest angles of incidence from an arbitrary point to ...
1
vote
0answers
97 views

The skeleton of Eulerian polyhedra

There is (at least) two kind of validity domain of Euler's $v−e+f=2$ polyhedron formula. One is the "Eulerian" polyhedra, i.e. simply connected polyhedra with simply connected faces (see here). The ...
1
vote
0answers
82 views

How to find out the circumscribed radius of a snub dodecahedron?

A snub dodecahedron is produced by partially rotating all 12 regular pentagonal faces of a small rhombocosidodecahedron. A snub dodecahedron has 80 congruent equilateral triangular faces, 12 congruent ...
1
vote
1answer
55 views

Is there any simply connected polyhedron with a not simply connected face?

According to Wikipedia, For a convex polyhedron or more generally for any simply connected polyhedron whose faces are also simply connected, χ = 2. Is it really necessary to specify here, that ...
3
votes
1answer
97 views

How does the existence of Platonic graphs imply the existence of Platonic solids?

I will use the following definitions Platonic graph: A 3-connected planar graph with faces bounded by the same number of edges and vertices having the same number of incident edges. (remark: ...
1
vote
1answer
120 views

computing Lefschetz number

We have a fixed point theorem which says that : Let $X$ be a compact polyhedron, $f:X\rightarrow X$ be a continuous map. If $L(f)\neq 0$ then $f$ must have a fixed point. (Lefschetz number is ...
5
votes
1answer
90 views

Is the adjective 'regular' necessary in the definition of Platonic solids?

The definition I mean can be found in the tag Wiki of Platonic solid tag and also in Wikipedia: Definition 1: A Platonic solid is a regular, convex polyhedron with congruent faces of ...
0
votes
0answers
75 views

Convex polyhedra with edges of equal length

This is again a natural category of polyhedra without having an own name. Is it possible, that their graphs are the same as the graphs of polyhedra with faces of regular polygons? My question is ...