Approximation of convex bodies by inscribed simplices of maximum volume
نویسندگان
چکیده
منابع مشابه
Approximation of convex bodies by inscribed simplices of maximum volume
The Banach-Mazur distance between an arbitrary convex body and a simplex in Euclidean n-space En is at most n+2. We obtain this estimate as an immediate consequence of our theorem which says that for an arbitrary convex body C in En and for any simplex S of maximum volume contained in C the homothetical copy of S with ratio n + 2 and center in the barycenter of S contains C . In general, this r...
متن کاملContainment and Inscribed Simplices
Let K and L be compact convex sets in Rn. The following two statements are shown to be equivalent: (i) For every polytope Q ⊆ K having at most n+ 1 vertices, L contains a translate of Q. (ii) L contains a translate of K. Let 1 ≤ d ≤ n − 1. It is also shown that the following two statements are equivalent: (i) For every polytope Q ⊆ K having at most d+ 1 vertices, L contains a translate of Q. (i...
متن کاملFine Approximation of Convex Bodies by Polytopes
We prove that for every convex body K with the center of mass at the origin and every ε ∈ ( 0, 12 ) , there exists a convex polytope P with at most eO(d)ε− d−1 2 vertices such that (1− ε)K ⊂ P ⊂ K.
متن کاملIntrinsic Volumes of Inscribed Random Polytopes in Smooth Convex Bodies
LetK be a d-dimensional convex bodywith a twice continuously differentiable boundary and everywhere positive Gauss–Kronecker curvature. Denote byKn the convex hull of n points chosen randomly and independently fromK according to the uniform distribution. Matching lower andupper bounds are obtained for the orders ofmagnitudeof the variances of the sth intrinsic volumes Vs(Kn) of Kn for s ∈ {1, ....
متن کاملMaximum volume simplices and trace-minimal graphs
Let (v, δ) be the set of all δ-regular graphs on v vertices. A graphG ∈ (v, δ) is trace-minimal in (v, δ) if the vector whose ith entry is the trace of the ith power of the adjacency matrix of G, is minimum under the lexicographic order among all such vectors corresponding to graphs in (v, δ). We consider the problem of maximizing the volume of an n-dimensional simplex consisting of n + 1 verti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry
سال: 2011
ISSN: 0138-4821,2191-0383
DOI: 10.1007/s13366-011-0026-x