Fiber Convex Bodies
نویسندگان
چکیده
Abstract In this paper we study the fiber bodies, that is extension of notion polytopes for more general convex bodies. After giving an overview properties focus on three particular classes First describe strict convexity bodies so called puffed polytopes. Then provide explicit equation support function some smooth Finally give a formula allows to compute zonoid with certain zonoids discotopes. Throughout illustrate our results detailed examples.
منابع مشابه
Shadows of Convex Bodies
It is proved that if C is a convex body in R" then C has an affine image C (of nonzero volume) so that if P is any 1-codimensional orthogonal projection, \PC\>\C\{tt~l)/n. It is also shown that there is a pathological body, K , all of whose orthogonal projections have volume about \fh~ times as large as |Ä"| . 0. Introduction The problems discussed in this paper concern the areas of shadows (or...
متن کاملEssentially-Euclidean convex bodies
In this note we introduce a notion of essentially-Euclidean normed spaces (and convex bodies). Roughly speaking, an n-dimensional space is λ-essentially-Euclidean (with 0 < λ < 1) if it has a [λn]dimensional subspace which has further proportionally dimensional Euclidean subspaces of any proportion. We consider a space X1 = (Rn, ‖ · ‖1) with the property that if a space X2 = (Rn, ‖ · ‖2) is “no...
متن کاملReductibility of Convex Bodies
Introduction Let C be a convex bounded body in the n-dimensional Euclidean space E, and let B be its boundary. We use Busemann's notations: E(a,b) for the segment {(1 — p)a + pb: 0 < p ^ 1} from a to b, and S(z, p) for the sphere {x: \\z — x\\ = p). We now recall the definition of Hammer's associated bodies C(r). Let Cb(r) be the set obtained from C by a similitude transformation with a ratio r...
متن کاملChasing Convex Bodies and Functions
We consider three related online problems: Online Convex Optimization, Convex Body Chasing, and Lazy Convex Body Chasing. In Online Convex Optimization the input is an online sequence of convex functions over some Euclidean space. In response to a function, the online algorithm can move to any destination point in the Euclidean space. The cost is the total distance moved plus the sum of the fun...
متن کاملEuclidean sections of convex bodies
This is a somewhat expanded form of a four hours course given, with small variations, first at the educational workshop Probabilistic methods in Geometry, Bedlewo, Poland, July 6-12, 2008 and a few weeks later at the Summer school on Fourier analytic and probabilistic methods in geometric functional analysis and convexity, Kent, Ohio, August 13-20, 2008. The main part of these notes gives yet a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete and Computational Geometry
سال: 2022
ISSN: ['1432-0444', '0179-5376']
DOI: https://doi.org/10.1007/s00454-022-00451-3