Approximation of convex bodies by polytopes with respect to minimal width and diameter

Abstract: Denote by

{m a t h c a l K}^{d}

the family of convex bodies in

E^{d}

and by

w (C)

the minimal width of

C i n {m a t h c a l K}^{d}

. We ask for the greatest number

L a m b d a_{n} ({m a t h c a l K}^{d})

such that every

C i n {m a t h c a l K}^{d}

contains a polytope

P

with at most

n

vertices for which

L a m b d a_{n} ({m a t h c a l K}^{d}) l e q f r a c w (P) w (C)

. We give a lower estimate of

L a m b d a_{n} ({m a t h c a l K}^{d})

for

n g e q 2 d

based on estimates of the smallest radius of

antipodal pairs of spherical caps that cover the unit sphere of

E^{d}

. We show that

L a m b d a_{3} ({m a t h c a l K}^{2}) g e q f r a c 12 (3 - s q r t 3)

, and

L a m b d a_{n} ({m a t h c a l K}^{2}) g e q c o s f r a c p i 2 l f l o o r n / 2 f l o o r

for every

n g e q 4

. We also consider the dual question of estimating the smallest number

D e l t a_{n} ({m a t h c a l K}^{d})

such that every

C i n {m a t h c a l K}^{d}

there exists a polytope

P s u p s e t C

with at most

n

facets for which

f r a c m d i a m (P) m d i a m (C) l e q D e l t a_{n} ({m a t h c a l K}^{d})

. We give an upper bound of

D e l t a_{n} ({m a t h c a l K}^{d})

for

n g e q 2 d

. In particular,

D e l t a_{n} ({m a t h c a l K}^{2}) l e q 1 / c o s f r a c p i 2 l f l o o r n / 2 f l o o r

for

n g e q 4

.

Cited In (5)

This page was built for publication: Approximation of convex bodies by polytopes with respect to minimal width and diameter