Stable Determination of Convex Bodies From Projections

If two convex bodies have the property that their orthogonal projections on any hyperplane have the same mean width and the same Steiner point, then the bodies are identical. This result is proved in a stronger stability version.     

On Sums of Projections

In the paper, for all n, we describe the set _n of all real numbers admitting a collection of projections P ₁,...,P _n on a Hilbert space H such that _k=1 ⁿ P _k= I (I is the identity operator on H) and study the problem to find all collections of this kind for a given _n .     

On Minkowski Sums of Simplices

We investigate the structure of the Minkowski sum of standard simplices in \mathbb R^r{{\mathbb R}^r}. In particular, we investigate the one-dimensional structure, the vertices, their degrees and the edges in the Minkowski sum polytope.     

On the Determination of Convex Bodies by Translates of Their Projections

It is a well-known fact that a three-dimensional convex body is, up to translations, uniquely determined by the translates of its orthogonal projections onto all planes. Simple examples show that this is no longer true if only lateral projections are permitted, that is orthogonal projections onto all planes that contain a given line. In this article large classes of convex bodies are specified that are essentially determined by translates or homothetic images of their lateral projections. The problem is considered for all dimensions , and corresponding stability results are proved. Finally, it is investigated to which degree of precision a convex body can be determined by a finite number of translates of its projections. Various corollaries concern characterizations and corresponding stability statements for convex bodies of constant width and spheres.     

On Minkowski Sums of Many Small Sets

It is proved that a weakly closed subset of a Banach space is convex if and only if it can be represented as the sum of sets of arbitrarily small diameter.     

Minkowski Sums of Monotone and General Simple Polygons

Let P be a simple polygon with m edges, which is the disjoint union of k simple polygons, all monotone in a common direction u, and let Q be another simple polygon with n edges, which is the disjoint union of ℓ simple polygons, all monotone in a common direction v. We show that the combinatorial complexity of the Minkowski sum P ⊕ Q is O(kℓmnα(min{m,n})), where α(·) is the inverse Ackermann function. Some structural properties of the case k = ℓ = 1 have been (implicitly) studied in [17]. We rederive these properties using a different proof, apply them to obtain the above complexity bound for k = ℓ = 1, obtain several additional properties of the sum for this special case, and then use them to derive the general bound.     

f-Vectors of Minkowski Additions of Convex Polytopes

The objective of this paper is to present two types of results on Minkowski sums of convex polytopes. The first is about a special class of polytopes we call perfectly centered and the combinatorial properties of the Minkowski sum with their own dual. In particular, we have a characterization of the face lattice of the sum in terms of the face lattice of a given perfectly centered polytope. Exact face counting formulas are then obtained for perfectly centered simplices and hypercubes. The second type of results concerns tight upper bounds for the f-vectors of Minkowski sums of several polytopes.     

凸体Minkowski不等式的改进

本文改进了凸体体积差的Minkowski不等式,获得了凸体混合体积差函数的Minkowski型不等式的加强形式,给出了凸体混合体积差函数的新的下界估计.     

Maximal f-Vectors of Minkowski Sums of Large Numbers of Polytopes

It is known that in the Minkowski sum of r polytopes in dimension d, with r<d, the number of vertices of the sum can be as high as the product of the number of vertices in each summand. However, the number of vertices for sums of more polytopes was unknown so far.     

On the Exact Maximum Complexity of Minkowski Sums of Polytopes

We present a tight bound on the exact maximum complexity of Minkowski sums of polytopes in ?³. In particular, we prove that the maximum number of facets of the Minkowski sum of k polytopes with m ₁,m ₂,…,m _k facets, respectively, is bounded from above by \(\sum_{1\leq i. Given k positive integers m ₁,m ₂,…,m _k , we describe how to construct k polytopes with corresponding number of facets, such that the number of facets of their Minkowski sum is exactly \(\sum_{1\leq i. When k=2, for example, the expression above reduces to 4m ₁ m ₂?9m ₁?9m ₂+26.     

Integer Decomposition Property of Free Sums of Convex Polytopes

Let \({\mathcal{P} \subset \mathbb{R}^{d}}\) and \({\mathcal{Q} \subset \mathbb{R}^{e}}\) be integral convex polytopes of dimension d and e which contain the origin of \({\mathbb{R}^{d}}\) and \({\mathbb{R}^{e}}\), respectively. We say that an integral convex polytope \({\mathcal{P}\subset \mathbb{R}^{d}}\) possesses the integer decomposition property if, for each \({n\geq1}\) and for each \({\gamma \in n\mathcal{P}\cap\mathbb{Z}^{d}}\), there exist \({\gamma^{(1)}, . . . , \gamma^{(n)}}\) belonging to \({\mathcal{P}\cap\mathbb{Z}^{d}}\) such that \({\gamma = \gamma^{(1)} +. . .+\gamma^{(n)}}\). In the present paper, under some assumptions, the necessary and sufficient condition for the free sum of \({\mathcal{P}}\) and \({\mathcal{Q}}\) to possess the integer decomposition property will be presented.     

On Translational Clouds for a Convex Body

For a d-dimensional convex body K let C(K) denote the minimum size of translational clouds for K. That is, C(K) is the minimum number of mutually non-overlapping translates of K which do not overlap K and block all the light rays emanating from any point of K. In this paper we prove the general upper bound . Furthermore, for an arbitrary centrally symmetric d-dimensional convex body S we show . Finally, for the d-dimensional ball B^d we obtain the bounds .     

凸体诱导的对称函数（英文）

This paper shows some properties of symmetry function induced by a convex body in a normal linear space. Some relationships between symmetry function induced by a convex body and Minkowski functional of the convex body are presented.     

Stability of the Minkowski Measure of Asymmetry for Convex Bodies

Given a convex body $C\subset R^n$ (i.e., a compact convex set with nonempty interior), for $x\in$ {\it int}$(C)$, the interior, and a hyperplane $H$ with $x\in H$, let $H_1,H_2$ be the two support hyperplanes of $C$ parallel to $H$. Let $r(H, x)$ be the ratio, not less than 1, in which $H$ divides the distance between $H_1,H_2$. Then the quantity $${\it As}(C):=\inf_{x\in {\it int}(C)}\,\sup_{H\ni x}\,r(H,x)$$ is called the Minkowski measure of asymmetry of $C$. {\it As}$(\cdot)$ can be viewed as a real-valued function defined on the family of all convex bodies in $R^n$. It has been known for a long time that {\it As}$(\cdot)$ attains its minimum value 1 at all centrally symmetric convex bodies and maximum value $n$ at all simplexes. In this paper we discuss the stability of the Minkowski measure of asymmetry for convex bodies. We give an estimate for the deviation of a convex body from a simplex if the corresponding Minkowski measure of asymmetry is close to its maximum value. More precisely, the following result is obtained: Let $C\subset R^n$ be a convex body. If {\it As}$(C)\ge n-\varepsilon$ for some $0\le \varepsilon < 1/8(n+1),$ then there exists a simplex $S_0$ formed by $n+1$ support hyperplanes of $C$, such that $$(1+8(n+1)\varepsilon)^{-1}S_0\subset C\subset S_0,$$ where the homethety center is the (unique) Minkowski critical point of $C$. So $$d_{{\rm BM}}(C,S)\le 1+8(n+1)\varepsilon$$ holds for all simplexes $S$, where $d_{{\rm BM}}(\cdot,\cdot)$ denotes the Banach-Mazur distance.     

The Determination of a Convex Set from Its Angle Function

In this paper we discuss the followingquestion: how can we decide whether a convex setis determined by its angle function or not? We givesufficient conditions for convex polygons and forregular convex sets which guarantee that the setis distinguishable. We also investigate the question: which setsare typical (in the sense of Baire category), thosewhich are distinguishable or those which are not?We prove that the family of distinguishable sets is ofsecond Baire category.