AbstractWe study properties of polytopes circumscribed by a unit sphere in Rn with either m extreme points or m facets. We show that if one measures the quality of approximation using the radius of an inscribing sphere then asymptotically the best-possible results are the same for both cases. Somewhat surprisingly, however, the volume can grow substantially faster in m for the case where the polytope has m facets
International audienceWe discuss the problem of computing points of IRn whose convex hull contains t...
Given n points in a d dimensional Euclidean space, the Minimum Enclosing Ball (MEB) problem is to fi...
When is the volume of a convex polytope in R^n close to the number of lattice points in the polytope...
AbstractWe study properties of polytopes circumscribed by a unit sphere in Rn with either m extreme ...
AbstractThe mean volume and the mean surface area of the convex hull of n random points chosen indep...
AbstractThe mean volume and the mean surface area of the convex hull of n random points chosen indep...
There is a constant c such that for every n N, there is a N n so that for every N with N verti...
. We consider approximations of a smooth convex body by inscribed and circumscribed convex polytopes...
The first recent result, obtained jointly with J. Grote, generalizes a theorem by Ludwig, Schuett ...
The first recent result, obtained jointly with J. Grote, generalizes a theorem by Ludwig, Schuett ...
International audienceGiven a set S in Rn, a (δ,ε)-ball approximation of S is defined as a collectio...
International audienceGiven a set S in Rn, a (δ,ε)-ball approximation of S is defined as a collectio...
International audienceWe discuss the problem of computing points of IRn whose convex hull contains t...
Approximating convex bodies is a fundamental question in geometry and has applications to a wide var...
International audienceWe discuss the problem of computing points of IRn whose convex hull contains t...
International audienceWe discuss the problem of computing points of IRn whose convex hull contains t...
Given n points in a d dimensional Euclidean space, the Minimum Enclosing Ball (MEB) problem is to fi...
When is the volume of a convex polytope in R^n close to the number of lattice points in the polytope...
AbstractWe study properties of polytopes circumscribed by a unit sphere in Rn with either m extreme ...
AbstractThe mean volume and the mean surface area of the convex hull of n random points chosen indep...
AbstractThe mean volume and the mean surface area of the convex hull of n random points chosen indep...
There is a constant c such that for every n N, there is a N n so that for every N with N verti...
. We consider approximations of a smooth convex body by inscribed and circumscribed convex polytopes...
The first recent result, obtained jointly with J. Grote, generalizes a theorem by Ludwig, Schuett ...
The first recent result, obtained jointly with J. Grote, generalizes a theorem by Ludwig, Schuett ...
International audienceGiven a set S in Rn, a (δ,ε)-ball approximation of S is defined as a collectio...
International audienceGiven a set S in Rn, a (δ,ε)-ball approximation of S is defined as a collectio...
International audienceWe discuss the problem of computing points of IRn whose convex hull contains t...
Approximating convex bodies is a fundamental question in geometry and has applications to a wide var...
International audienceWe discuss the problem of computing points of IRn whose convex hull contains t...
International audienceWe discuss the problem of computing points of IRn whose convex hull contains t...
Given n points in a d dimensional Euclidean space, the Minimum Enclosing Ball (MEB) problem is to fi...
When is the volume of a convex polytope in R^n close to the number of lattice points in the polytope...
DOI
Add to ORKG