Related papers: On the approximation error for approximating conve…
The approximability of a convex body is a number which measures the difficulty to approximate that body by polytopes. We prove that twice the approximability is equal to the volume entropy for a Hilbert geometry in dimension two end three…
Approximation problems involving a single convex body in $d$-dimensional space have received a great deal of attention in the computational geometry community. In contrast, works involving multiple convex bodies are generally limited to…
While there is extensive literature on approximation, deterministic as well as random, of general convex bodies $K$ in the symmetric difference metric, or other metrics arising from intrinsic volumes, very little is known for corresponding…
In multi-objective optimization, computing the entire non-dominated set (also known as the Pareto front or the Pareto frontier) is often intractable. However, for any multiplicative factor greater than one, an approximation set can be…
A key problem in multiobjective linear programming is to find the set of all efficient extreme points in objective space. In this paper we introduce oriented projective geometry as an efficient and effective framework for solving this…
We consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex…
We derive lower estimates for the approximation of the $d$-dimensional Euclidean ball by polytopes with a fixed number of $k$-dimensional faces, $k\in\{0,1,\ldots,d-1\}$. The metrics considered include the intrinsic volume difference and…
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…
We study the Hausdorff distance between a random polytope, defined as the convex hull of i.i.d. random points, and the convex hull of the support of their distribution. As particular examples, we consider uniform distributions on convex…
The volume is an important attribute of a convex body. In general, it is quite difficult to calculate the exact volume. But in many cases, it suffices to have an approximate value. Volume estimation methods for convex bodies have been…
In the optimization of convex domains under a PDE constraint numerical difficulties arise in the approximation of convex domains in $\mathbb{R}^3$. Previous research used a restriction to rotationally symmetric domains to reduce shape…
Polyhedral-type approximations of convex-like domains in $\mathbb{C}^d$ have been considered recently by the second author. In particular, the decay rate of the error in optimal volume approximation as a function of the number of facets has…
The article deals with operations defined on convex polyhedra or polyhedral convex functions. Given two convex polyhedra, operations like Minkowski sum, intersection and closed convex hull of the union are considered. Basic operations for…
We discuss how well a given convex body B in a real d-dimensional vector space V can be approximated by a set X for which the membership question: ``given an x in V, does x belong to X?'' can be answered efficiently (in time polynomial in…
We investigate algorithms for reconstructing a convex body $K$ in $\mathbb {R}^n$ from noisy measurements of its support function or its brightness function in $k$ directions $u_1,...,u_k$. The key idea of these algorithms is to construct a…
This article is concerned with the approximation of unbounded convex sets by polyhedra. While there is an abundance of literature investigating this task for compact sets, results on the unbounded case are scarce. We first point out the…
A natural model for the approximation of a convex body $K$ in $\mathbb{R}^d$ by random polytopes is obtained as follows. Take a stationary Poisson hyperplane process in the space, and consider the random polytope $Z_K$ defined as the…
We present a simple and efficient acceleration technique for an arbitrary method for computing the Euclidean projection of a point onto a convex polytope, defined as the convex hull of a finite number of points, in the case when the number…
Approximating convex bodies is a fundamental question in geometry, which has a wide variety of applications. Given a convex body $K$ in $\textbf{R}^d$ for fixed $d$, the objective is to minimize the number of facets of an approximating…
We provide an affirmative answer to a problem posed by Barvinok and Veomett, showing that in general an n-dimensional convex body cannot be approximated by a projection of a section of a simplex of a sub-exponential dimension. Moreover, we…