Related papers: Best and random approximation of a convex body by …
This paper considers the problem of smoothing convex functions and sets, seeking the nearest smooth convex function or set to a given one. For convex cones and sublinear functions, a full characterization of the set of all optimal…
We introduce complex intersection bodies and show that their properties and applications are similar to those of their real counterparts. In particular, we generalize Busemann's theorem to the complex case by proving that complex…
A random spherical polytope $P_n$ in a spherically convex set $K \subset S^d$ as considered here is the spherical convex hull of $n$ independent, uniformly distributed random points in $K$. The behaviour of $P_n$ for a spherically convex…
We prove sharp inequalities for the average number of affine diameters through the points of a convex body $K$ in ${\mathbb R}^n$. These inequalities hold if $K$ is either a polytope or of dimension two. An example shows that the proof…
Probably we have observed a new simple phenomena dealing with approximations to two real numbers.
Many random combinatorial objects have a component structure whose joint distribution is equal to that of a process of mutually independent random variables, conditioned on the value of a weighted sum of the variables. It is interesting to…
The Haugazeau method was originally designed to compute the best approximation from an intersection of closed convex sets in Hilbert spaces using the projection operators onto the individual sets iteratively. We propose an abstract…
The purpose of this paper is to answer the following question: If all hyperplane sections through the origin of a convex body are "equal", is the convex body "equal" to the ball? The meaning of the notion "equal" will change in the course…
We display four approximation theorems for manifold-valued mappings. The first one approximates holomorphic embeddings on pseudoconvex domains in $\Bbb C^n$ with holomorphic embeddings with dense images. The second theorem approximates…
We present a procedure to approximate a plane contour by piecewise polynomial functions, depending on various parameters, such as degree, number of local patches, selection of knots. This procedure aims to be adopted to study how…
We present a constructive approach for approximating the conformal map (uniformization) of a polyhedral surface to a canonical domain in the plane. The main tool is a characterization of convex spaces of quasiconformal simplicial maps and…
We establish central limit theorems for natural volumes of random inscribed polytopes in projective Riemannian or Finsler geometries. In addition, normal approximation of dual volumes and the mean width of random polyhedral sets are…
Motivated by the need to better understand the properties of sparse cutting-planes used in mixed integer programming solvers, the paper [2] studied the idealized problem of how well a polytope is approximated by the use of sparse valid…
Facets of the convex hull of $n$ independent random vectors chosen uniformly at random from the unit sphere in $\mathbb{R}^d$ are studied. A particular focus is given on the height of the facets as well as the expected number of facets as…
This paper is devoted to measures of symmetry based on distance between centroid and one of the centers of John and Lowner ellipsoid. The author proves the accuracy of the derived upper bounds for the considered measures of symmetry.
In this paper we compare the different phenomena that occur when intersecting geometric objects with random geodesics on the unit sphere and inside convex bodies. On the high dimensional sphere we see that with probability bounded away from…
It is shown how the Beneath-and-Beyond algorithm can be used to yield another proof of the equivalence of V- and H-representations of convex polytopes. In this sense this paper serves as the sketch of an introduction to polytope theory with…
The study of several naturally arising "nearest neighbours" random walks benefits from the study of the associated orthogonal polynomials and their orthogonality measure. I consider extensions of this approach to a larger class of random…
We give a polynomial-time constant-factor approximation algorithm for maximum independent set for (axis-aligned) rectangles in the plane. Using a polynomial-time algorithm, the best approximation factor previously known is $O(\log\log n)$.…
Conventional approximations to Bayesian inference rely on either approximations by statistics such as mean and covariance or by point particles. Recent advances such as the ensemble Gaussian mixture filter have generalized these notions to…