Skip to main content

All Questions

20 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
20 votes
0 answers
433 views

Is the dodecahedron flexible (as a polytope with fixed edge-lengths)?

Consider the (regular) dodecahedron $D\subset\Bbb R^3$. I want to continuously deform it so that throughout the deformation it stays a convex polytope, it stays a combinatorial dodecahedron (i.e. its ...
M. Winter's user avatar
  • 13.6k
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
6 votes
1 answer
254 views

Triangulations of convex surfaces

Let $M$ be a smooth closed positively curved surface in Euclidean 3-space, $T$ be a geodesic triangulation of $M$, and $E$ be the edge graph of the convex hull of vertices of $T$. It is easy to see ...
Mohammad Ghomi's user avatar
5 votes
0 answers
93 views

Which polytopes can be deformed while keeping their edge-lengths?

Let $P\subset\Bbb R^d$ be a convex polytope (a convex hull of finitely many points). Lets call it flexible, if it can be continuously deformed while keeping its combinatorial type, and keeping its ...
M. Winter's user avatar
  • 13.6k
4 votes
0 answers
52 views

Quantifying error in the reconstruction of convex polytopes from moments

The problem of reconstructing a geometric object from its moments is of interest in a variety of fields. In the paper The Inverse Moment Problem for Convex Polytopes, the authors show that a convex ...
Lucas Blakeslee's user avatar
4 votes
0 answers
224 views

Characterization of curves contained in the boundary of convex bodies

Given a continuous closed curve $\gamma$ in $\mathbb R^n$ does there exist a convex body $K$ (convex set with non-empty interior) such that $\gamma\subset \partial K$? I am looking for a reference to ...
Vadim Semenov's user avatar
4 votes
0 answers
229 views

How to find the dimension of the polar cone of a convex cone generated by some given vectors

Suppose we have access to a generating set $\{v_1, ..., v_k\}\subseteq\mathbb{R}^n$ of the convex cone $C=cone(v_1, ..., v_k)$, where $cone(\cdot)$ is the conical hull (i.e. nonnegative span) of ...
Min Wu's user avatar
  • 461
3 votes
0 answers
52 views

Deformations that flatten small curvature

I'm trying to show that any 3-dimensional polyhedron with many vertices can be mildly deformed so that its vertices are no longer convexly independent. I suspect it suffices to look at a vertex with ...
jnhnum1's user avatar
  • 31
2 votes
0 answers
51 views

Estimating the Hausdorff distance of parallel facets of convex polytopes

Background Let $\mathcal{K}_P^n$ denote the class of open, convex, $n$-dimensional polytopes in $\mathbb{R}^n$ containing the origin. For each $K\in \mathcal{K}_P^n$, its gauge function $f_*:\mathbb{R}...
kenvergence's user avatar
2 votes
0 answers
103 views

Polytopes with large dihedral angles

The regular $d$-simplex has dihedral angle $\arccos(1/d)<90^\circ$, and the $d$-cube has dihedral angle exactly $90^\circ$. The maximal dihedral angle of a prism over a $(d-1)$-simplex is also $90^\...
M. Winter's user avatar
  • 13.6k
2 votes
0 answers
41 views

Describing hull of vertex intersections of two convex bounded polytopes?

We have two convex bounded polytopes $P_1$ and $P_2$ where a. $P_2\subseteq P_1$ b. $\mathcal{V}(P_2)\cap\mathcal{V}(P_1)\neq\emptyset$. Is there a name for the polytope $P=\mbox{Conv}(\mathcal{V}(...
Turbo's user avatar
  • 13.9k
2 votes
0 answers
415 views

Find the intersection between two convex hulls, in this specific case

We work over $\mathbb{R}^K$. Let $V$ be the set of vectors whose coordinates take values $0$ or $1$, or equivalently the corners of the unit cube $[0,1]^K$. Let $d:\{0, \ldots, K\} \to \mathbb{R}_+$ ...
tam's user avatar
  • 233
1 vote
0 answers
40 views

Polyhedra inscribed in a sphere with mutually non-congruent, equal area faces

Two constrained versions of the main question given in this post: Polyhedrons with mutually non-congruent faces, all of equal area. An earlier post that could be related: Cutting a spherical surface ...
Nandakumar R's user avatar
  • 5,979
1 vote
0 answers
61 views

Fitting a convex polytope with 𝑛 facets between two nested spheres

This is related to a research problem that is interested in approximation of spheres by convex polytopes. Let $C_r$ and $C_R$ be two spheres in $\mathbb R^d$ of radius $r$ and $R$, respectively, where ...
pyridoxal_trigeminus's user avatar
1 vote
0 answers
43 views

Quantitative error control in Minkowski-Stein formula

Let $K\subseteq\mathbb R^d$ be a compact convex body with non-empty interior, and $E$ be a $(d-1)$-dimensional linear subspace of $\mathbb R^d$. Let $\theta\in\mathbb R^d$ be the unit vector such that ...
Yining Wang's user avatar
1 vote
0 answers
117 views

Inscribed polytopal approximation to a convex body

This question is on the continuation of the post Approximation of convex body by polytopes The central problem I am interested is an explicit construction of inscribed polytope with at most $n$ ...
Roy Han's user avatar
  • 599
1 vote
0 answers
50 views

Projection of a ray onto a random polytope

Suppose $P$ is a polytope formed by $p$ (general) random planes in $\mathbb{R}^n$. We assume $p \asymp n$ and $P$ has a diameter $O(\sqrt{n})$. For any $x \in \mathbb{R}^n$, denote by $\operatorname{...
John Wong's user avatar
  • 773
0 votes
0 answers
37 views

Constructing a minimum-volume outer approximation polytope with fewer facets

I am tackling the following problem: Given a set of points $D \in \mathbb{R}^d$ and their convex hull, represented with $n$ facets, I want to construct a convex polytope $P$ with at most $m<n$ ...
Shperb's user avatar
  • 101
0 votes
0 answers
752 views

Upper and Lower Bounds of the Total Surface Area of Convex Polytopes that Partition a Hypercube

Let $C$ be a hypercube in $\mathbb{R}^D$ with edge length of $L$. Let $\mathcal{P}_1,\ldots,\mathcal{P}_K$ be $K$ convex polytopes that partition $C$. Let $S_k$ be the surface area of the polytope $\...
Han Xiao's user avatar
  • 111