Skip to main content

All Questions

Filter by
Sorted by
Tagged with
44 votes
11 answers
26k views

Algorithm for finding the volume of a convex polytope

It's easy to find the area of a convex polygon by division into triangles, but what is the optimal way of finding the volume of higher-dimensional convex bodies? I tried a few methods for dividing ...
Xerxes's user avatar
  • 441
21 votes
5 answers
1k views

Is there a midsphere theorem for 4-polytopes?

The (remarkable) midsphere theorem says that each combinatorial type of convex polyhedron may be realized by one all of whose edges are tangent to a sphere (and the realization is unique if the center ...
Joseph O'Rourke's user avatar
20 votes
4 answers
950 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 ...
Joseph O'Rourke's user avatar
14 votes
0 answers
479 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 ...
Piotr Shatalin's user avatar
13 votes
0 answers
252 views

Does there always exist a self dual polytope that contains a given polytope contained in its dual?

Suppose a polytope $P$ is contained in its dual polytope $\tilde{P}$. Does there always exist a polytope $Q$ that contains $P$ and is self dual $Q=\tilde{Q}$? Is there any bound on the minimal number ...
Huangjun Zhu's user avatar
9 votes
1 answer
240 views

Cyclic polygons generalized to higher dimensions

Many theorems hold for cyclic polygons—convex polygons inscribed in a circle. Perhaps the most basic is this, from the reference cited below: Theorem. There exists a cyclic polygon of $n \ge ...
Joseph O'Rourke's user avatar
7 votes
1 answer
648 views

Maximal volume of a simplex inscribed in a spherical cap

Let $B_n$ be the $n$-dimensional unit ball, and $B_n(\varepsilon)$ be the spherical cap with height $\varepsilon$ I am interested in the quantity $$\Gamma:=\sup_{\Delta:\textrm{ inscribed simplex in }...
Roy Han's user avatar
  • 599
5 votes
2 answers
294 views

Convex caps with prescribed edges

Let $P$ be a convex polygon in the plane $R^2=R^2\times \{0\}$, and $E$ be the edge graph of some subdivision of $P$ into convex polygons, which is $3$-connected. Does there exist a convex polyhedral ...
Mohammad Ghomi's user avatar
2 votes
1 answer
308 views

Intersection of the simplex with a linear subspace of codimension $2$

The sets are defined in $\mathbb{R}_+^n$ $(n\geq 1)$. The relative interior of a convex set $C$ is denoted $\mathring C$. Let $S$ be the $n$-simplex: $$S=\left\{x\in\mathbb{R}_+^n,\,\sum_{i=1}^n x_i=1\...
G. Panel's user avatar
  • 449
0 votes
4 answers
457 views

Confining a polytope to one side of an affine hyperplane

Judging whether one convex polytope is inside of another when both are expressed as a system of linear inequalities seems not to be an easy problem. This answer on math.stackexchange.com claims the ...
Hans's user avatar
  • 2,239