𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Recursive algorithms for inner ellipsoidal approximation of convex polytopes

✍ Scribed by Fabrizio Dabbene; Paolo Gay; Boris T. Polyak

Book ID
108307343
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
248 KB
Volume
39
Category
Article
ISSN
0005-1098

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Approximation problems for combinatorial
Approximation problems for combinatorial isomorphism classes of convex polytopes
✍ Magelone KΓΆmhoff; G. C. Shephard πŸ“‚ Article πŸ“… 1974 πŸ› Springer 🌐 English βš– 780 KB

ISOMORPHISM CLASSES OF CONVEX POLYTOPES ## 1. Introduction Let ~a denote the set of all d-dimensional convex polytopes (d-polytopes) in d-dimensional Euclidean space R d. For any Pe~ a we write [P] for the class of all d-polytopes combinatorially isomorphic to P. For the definitions of these terms

Algorithms for Polyhedral Approximation
Algorithms for Polyhedral Approximation of Multidimensional Ellipsoids
✍ Mario A Lopez; Shlomo Reisner πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 316 KB

We present efficient and simple algorithms for the approximation of a d-dimensional ellipsoid by polytopes of a prescribed size which are either contained in or contain the ellipsoid. The polytopes provided by our algorithms have a high degree of regularity, which enables us to construct their j-ske