Related papers: Surface area deviation between smooth convex bodie…

We show that the fundamental objects of the $L_p$-Brunn-Minkowski theory, namely the $L_p$-affine surface areas for a convex body, are closely related to information theory: they are exponentials of R\'enyi divergences of the cone measures…

We prove power series expansions for the expectations of the number of vertices and missed area of random $L$-convex polygons in planar convex bodies with sufficiently smooth boundaries. Random $L$-convex polygons arise as the intersection…

Let K be a convex body in $R^d$. A random polytope is the convex hull $[x_1,...,x_n]$ of finitely many points chosen at random in K. $\Bbb E(K,n)$ is the expectation of the volume of a random polytope of n randomly chosen points. I.…

A spherical polyhedron surface is a triangulated surface obtained by isometric gluing of spherical triangles. For instance, the boundary of a generic convex polytope in the 3-sphere is a spherical polyhedron surface. This paper investigates…

In the process of projecting the surface of a three-dimensional object onto a two-dimensional surface, due to the perspective distortion, the image on the surface of the object will have different degrees of distortion according to the…

The description of invariants of surfaces with respect to the motion groups is reduced to the description of invariants of parameterized surfaces with respect to the motion groups. Existence of a commuting system of invariant partial…

We prove area bounds for planar convex bodies in terms of their number of interior integral points and their lattice width data. As an application, we obtain sharp area bounds for rational polygons with a fixed number of interior integral…

We prove asymptotic lower bounds on the variance of the number of vertices and missed area of random disc-polygons in convex discs whose boundary is $C_+^2$ smooth. The established lower bounds are of the same order as the upper bounds…

In this paper, we propose the Fourier Discrepancy Function, a new discrepancy to compare discrete probability measures. We show that this discrepancy takes into account the geometry of the underlying space. We prove that the Fourier…

In this paper, we give an overview of some results concerning best and random approximation of convex bodies by polytopes. We explain how both are linked and see that random approximation is almost as good as best approximation.

We study the algebraic boundary of a convex semi-algebraic set via duality in convex and algebraic geometry. We generalize the correspondence of facets of a polytope to the vertices of the dual polytope to general semi-algebraic convex…

We consider the convex hull of a finite sample of i.i.d. points uniformly distributed in a convex body in $\R^d$, $d\geq 2$. We prove an exponential deviation inequality, which leads to rate optimal upper bounds on all the moments of the…

We investigate methods for determining if a planar surface contains geometric deviations (e.g., protrusions, objects, divots, or cliffs) using only an instantaneous measurement from a miniature optical time-of-flight sensor. The key to our…

The random polytope $K_n$, defined as the convex hull of $n$ points chosen uniformly at random on the boundary of a smooth convex body, is considered. Proofs for lower and upper variance bounds, strong laws of large numbers and central…

We investigate geometrical properties and inequalities satisfied by the complex difference body, in the sense of studying which of the classical ones for the difference body have an analog in the complex framework. Among others we give an…

Let $K$ be a planar convex body af area $|K|$, and take $0 \textless{} \alpha \textless{} 1$.An $\alpha$-section of $K$ is a line cutting $K$ into two parts, one of whichhas area $\alpha|K|$. This article presents a systematic study of the…

We investigate the intersection body of a convex polytope using tools from combinatorics and real algebraic geometry. In particular, we show that the intersection body of a polytope is always a semialgebraic set and provide an algorithm for…

The distance between convex bodies \(K, L \subseteq \R^n\) is defined as \[ d(K,L)= \inf \left\{ \lambda \ge 1: \ L-x \subseteq T (K-y) \subseteq \lambda (L-x) \right\}, \] where the infimum is taken over all \(x,y \in \R^n\) and all…

This article is a survey of recent results on slicing inequalities for convex bodies. The focus is on the setting of arbitrary measures in place of volume.

In this paper we shall consider some famous means such as arithmetic, harmonic, geometric, root square mean, etc. Considering the difference of these means, we can establish. some inequalities among them. Interestingly, the difference of…