-1
votes
1answer
38 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
0answers
27 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 ...
0
votes
1answer
50 views

Probability that a $n$-dimensional Gaussian falls into a half-space

For $a \in \mathbb{R}_{\ge 0}^d$ and $b \in \mathbb{R}_{\ge 0}$, we can define a half-space as the set of points $x \in \mathbb{R}^d$ such that $a \cdot x \le b$, namely, $$\mathcal{H}(a,b) = \{x \in ...
4
votes
2answers
105 views

Is projection of a convex polyhedron on a plane a convex polygon?

If we have a convex polyhedron with vertices $\mathbf{V}$ and project it on a plane $\mathbf{P}$, is this procedure equivalent to projecting points in $\mathbf{V}$ on the plane $\mathbf{P}$ and then ...
1
vote
0answers
42 views

Convex polyhedron is union of simplices

Given a convex polyhedron $P$, how can we prove that every point $x \in P$ is in some simplex whose vertices are vertices of $P$? One proof is to inductively build a triangulation of $P$. If $P$ is ...
0
votes
1answer
107 views

Computing bounding box of polytope (system of linear inequalities)

Given a N real valued variables and a set of linear inequality constraints, I would like to find a minimal bounding box which encapsulates the convex polytope defined by these constraints. I think ...
4
votes
0answers
50 views

Mappings preserving convex polyhedra

It is known that linear mappings between euclidean spaces map convex polyhedra to convex polyhedra. Can you give a characterization of the class of mappings that preserve convex polyhedra?
1
vote
1answer
228 views

How to compute the image of a polyhedron under a linear transformation

Suppose $P$ is a polyhedron whose representation as a system of linear inequalities is given to us: $$ P = \{ x ~|~ Ax \leq b\}$$ Define $P'$ be the image of $P$ under the linear transformation which ...