In this paper we establish the existence and partial regularity of a (d-2)-dimensional edge-length minimizing polyhedron in [Special characters omitted.] . The minimizer is a generalized convex polytope of volume one which is the limit of a minimizing sequence of polytopes converging in the Hausdorff metric. We show that the (d-2)-dimensional edge-length ζ d -2 is lower-semicontinuous under this sequential convergence. Here the edge set of the limit generalized polytope is a closed subset of the boundary whose complement in the boundary consists of countably many relatively open planar regions
A polytope in a finite-dimensional normed space is subequilateral if the length in the norm of each ...
International audienceConvex bodies play a fundamental role in geometric computation, and approximat...
This paper is dedicated to G¶abor Fejes T¶oth on occasion of his sixtieth birthday. Abstract. We pro...
We study the existence of solutions to general measure-minimization problems over topological classe...
Abstract. We give a lower bound for the number of vertices of a general d-dimensional polytope with ...
We define two $d$-polytopes, both with $2d+2$ vertices and $(d+3)(d-1)$ edges, which reduce to the c...
For a d-dimensional polytope with v vertices, d + 1 = 0.62d. This confirms a conjecture of Grunbaum,...
The problem of calculating exact lower bounds for the number of $k$-faces of $d$-polytopes with $n$ ...
AbstractThe problem of determining the largest volume of a (d + 2)-point set in Ed of unit diameter ...
The problem of approximating convex bodies by polytopes is an important and well studied problem. Gi...
Let us recall that a subset of Rn is said to be minimal if its d-dimensional Hausdorff measure canno...
International audienceApproximating convex bodies succinctly by convex polytopes is a fundamental pr...
Abstract: In this paper we study the compact and convex sets K in the plane, that minimize the avera...
We consider the problem of projecting a point in a polyhedral set onto the boundary of the set using...
Approximating convex bodies is a fundamental question in geometry and has applications to a wide var...
A polytope in a finite-dimensional normed space is subequilateral if the length in the norm of each ...
International audienceConvex bodies play a fundamental role in geometric computation, and approximat...
This paper is dedicated to G¶abor Fejes T¶oth on occasion of his sixtieth birthday. Abstract. We pro...
We study the existence of solutions to general measure-minimization problems over topological classe...
Abstract. We give a lower bound for the number of vertices of a general d-dimensional polytope with ...
We define two $d$-polytopes, both with $2d+2$ vertices and $(d+3)(d-1)$ edges, which reduce to the c...
For a d-dimensional polytope with v vertices, d + 1 = 0.62d. This confirms a conjecture of Grunbaum,...
The problem of calculating exact lower bounds for the number of $k$-faces of $d$-polytopes with $n$ ...
AbstractThe problem of determining the largest volume of a (d + 2)-point set in Ed of unit diameter ...
The problem of approximating convex bodies by polytopes is an important and well studied problem. Gi...
Let us recall that a subset of Rn is said to be minimal if its d-dimensional Hausdorff measure canno...
International audienceApproximating convex bodies succinctly by convex polytopes is a fundamental pr...
Abstract: In this paper we study the compact and convex sets K in the plane, that minimize the avera...
We consider the problem of projecting a point in a polyhedral set onto the boundary of the set using...
Approximating convex bodies is a fundamental question in geometry and has applications to a wide var...
A polytope in a finite-dimensional normed space is subequilateral if the length in the norm of each ...
International audienceConvex bodies play a fundamental role in geometric computation, and approximat...
This paper is dedicated to G¶abor Fejes T¶oth on occasion of his sixtieth birthday. Abstract. We pro...