AbstractWith focus on the case of variable dimension n, this paper is concerned with deterministic polynomial-time approximation of the maximum j-measure of j-simplices contained in a given n-dimensional convex body K. Under the assumption that K is accessible only by means of a weak separation oracle, upper and lower bounds on the accuracy of oracle-polynomial-time approximations are obtained
AbstractThis paper presents a new algorithm for the convex hull problem, which is based on a reducti...
Relative to a given convex body C, a j-simplex S in C is largest if it has maximum volume (j-measure...
In general dimension, there is no known total polynomial algorithm for either convex hull or vertex ...
AbstractThis paper considers the problem of computing the squared volume of a largest j-dimensional ...
We show that the problem of finding the simplex of largest volume in the convex hull of n points in ...
We give a 2^{O(n)}(1+1/eps)^n time and poly(n)-space deterministic algorithm for computing a (1+eps)...
Approximating convex bodies succinctly by convex polytopes is a fundamental problem in discrete geom...
Convex bodies are ubiquitous in computational geometry and optimization theory. The high combinatori...
We discuss how well a given convex body B in a real d-dimensional vector space V can be approximated...
We give a deterministic polynomial space construction for nearly optimal -nets with respect to any i...
International audienceConvex bodies play a fundamental role in geometric computation, and approximat...
AbstractWe consider the computation of the volume of the union of high-dimensional geometric objects...
AbstractWe investigate the computational complexity of computing the convex hull of a two-dimensiona...
This thesis is focused on the limits of performance of large-scale convex optimization algorithms. C...
AbstractAssume that a set of imprecise points in the plane is given, where each point is specified b...
AbstractThis paper presents a new algorithm for the convex hull problem, which is based on a reducti...
Relative to a given convex body C, a j-simplex S in C is largest if it has maximum volume (j-measure...
In general dimension, there is no known total polynomial algorithm for either convex hull or vertex ...
AbstractThis paper considers the problem of computing the squared volume of a largest j-dimensional ...
We show that the problem of finding the simplex of largest volume in the convex hull of n points in ...
We give a 2^{O(n)}(1+1/eps)^n time and poly(n)-space deterministic algorithm for computing a (1+eps)...
Approximating convex bodies succinctly by convex polytopes is a fundamental problem in discrete geom...
Convex bodies are ubiquitous in computational geometry and optimization theory. The high combinatori...
We discuss how well a given convex body B in a real d-dimensional vector space V can be approximated...
We give a deterministic polynomial space construction for nearly optimal -nets with respect to any i...
International audienceConvex bodies play a fundamental role in geometric computation, and approximat...
AbstractWe consider the computation of the volume of the union of high-dimensional geometric objects...
AbstractWe investigate the computational complexity of computing the convex hull of a two-dimensiona...
This thesis is focused on the limits of performance of large-scale convex optimization algorithms. C...
AbstractAssume that a set of imprecise points in the plane is given, where each point is specified b...
AbstractThis paper presents a new algorithm for the convex hull problem, which is based on a reducti...
Relative to a given convex body C, a j-simplex S in C is largest if it has maximum volume (j-measure...
In general dimension, there is no known total polynomial algorithm for either convex hull or vertex ...