Given any convex set $A\in\mathbb{R}^d$, we denote by $V(A)$ its $d$-volume. Furthermore, given any two convex sets $A_1,A_2\in\mathbb{R}^d$, we denote by $V_{A_1,A_2}$ the $d$-volume of the symmetric difference $V\left(A_1 \triangle A_2\right)$ (informally, a small value of $V_{A_1,A_2}$ compared to $V(A_1)$ and $V(A_2)$, can viewed as $A_1$ well approximating $A_2$ and $A_2$ well approximating $A_1$).
Let $\mathcal{S}$ be the set of all $d$-dimensional convex shapes $S$ such that there exists a constant $\delta\in (0,1]$ independent of $d$ for which we have $V(S)\ge\delta V(B)$, where $B$ is the bounding box of $S$.
Question: How can we prove or disprove that for all convex shapes $S\in\mathcal{S}$, there exists a convex polytope $P$ satisfying the following property?
- Given any constant $\gamma>0$ independent of $d$ for which we have $V_{S,P}\le \gamma V(S)$, there exists an integer $k(\gamma)$ independent of $d$ such that the number of $(d-1)$-dimensional facets of $P$ is upper bounded by $d^{k(\gamma)}$.
Note: This post stems from a discussion with Anthony Quas in the comments of Approximating any convex shape in $\mathbb{R}^d$ with a polytope having $\mathrm{poly}(d)$ facets.
Note that for $\gamma\ge\frac{1}{\delta}-1$ the polytope $P$ can be trivially identified as bounding box $B$ of $S$.