Reconstruction of Centrally Symmetrical Convex Bodies by Projection Curvature Radii

In this article we pose the problem of existence and uniqueness of convex body for which the projection curvature radius function coincides with given function. We find a necessary and sufficient condition that ensures a positive answer to both questions and suggest an algorithm of construction of the body. Also we find a representation of the support function of a convex body by projection curvature radii.

We discuss a construction that gives counterexamples to various questions of unique determination of convex bodies.

This work provides two sufficient conditions in terms of sections or projections for a convex body to be a polytope. These conditions are necessary as well.

In this work we prove the following result: Let $K$ be a strictly convex body in the Euclidean space $\mathbb{R}^n, n\geq 3$, and let $L$ be a hypersurface, which is the image of an embedding of the sphere $\mathbb{S}^{n-1}$, such that $K$ is contained in the interior of $L$. Suppose that, for every $x\in L$, there exists $y\in L$ such that the support double-cones of $K$ with apexes at $x$ and $y$, differ by a translation. Then $K$ and $L$ are centrally symmetric and concent...

We investigate how much information about a convex body can be retrieved from a finite number of its geometric moments. We give a sufficient condition for a convex body to be uniquely determined by a finite number of its geometric moments, and we show that among all convex bodies, those which are uniquely determined by a finite number of moments form a dense set. Further, we derive a stability result for convex bodies based on geometric moments. It turns out that the stabilit...

In this paper we consider the problem of constructing numerical algorithms for approximating of convex compact bodies in d-dimensional Euclidean space by polytopes with any given accuracy. It is well known that optimal with respect to the order algorithms produces polytopes for which the accuracy in Hausdorff metric is inversely proportional to the number of vertices (faces) in the degree of 2/(d-1). Numerical approximation algorithms can be adaptive (active) when the vertice...

This article proposes a new discrete framework for approximating solutions to shape optimization problems under convexity constraints. The numerical method, based on the support function or the gauge function, is guaranteed to generate discrete convex shapes and is easily implementable using standard optimization software. The framework can handle various objective functions ranging from geometric quantities to functionals depending on partial differential equations. Width or...

Existence of convex body with prescribed generalized curvature measures is discussed, this result is obtained by making use of Guan-Li-Li's innovative techniques. In surprise, that methods has also brought us to promote Ivochkina's $C^2$ estimates for prescribed curvature equation in \cite{I1, I}.

A classical theorem of Alon and Milman states that any $d$ dimensional centrally symmetric convex body has a projection of dimension $m\geq e^{c\sqrt{\ln{d}}}$ which is either close to the $m$-dimensional Euclidean ball or to the $m$-dimensional cross-polytope. We extended this result to non-symmetric convex bodies.

The object of our investigation is a point that gives the maximum value of a potential with a strictly decreasing radially symmetric kernel. It defines a center of a body in Rm. When we choose the Riesz kernel or the Poisson kernel as the kernel, such centers are called a radial center or an illuminating center, respectively. The existence of a center is easily shown but the uniqueness does not always hold. Sufficient conditions of the uniqueness of a center have been studied...