Inner and outer approximations of polytopes using boxes

Computational Geometry: Theory and Applications

Volumn 27, Issue 2, 2004, Pages 151-178

  Bemporad, Alberto ^a   Filippi, Carlo ^b   Torrisi, Fabio D ^c  

^a UNIVERSITY OF SIENA   (Italy)

^b UNIVERSITY OF PADOVA   (Italy)

^c ETH ZURICH   (Switzerland)

Author keywords

Approximation; Boxes; Containment; Polytopes; Reachability analysis

Indexed keywords

EID: 84867965619     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(03)00048-8     Document Type: Article

References (17)

1. I. Bárány, and Z. Füredi Computing the volume is difficult Discrete Comput. Geom. 2 1987 319 326
2. A. Bemporad, K. Fukuda, and F.D. Torrisi Convexity recognition of the union of polyhedra Computational Geometry 18 2001 141 154
3. B. Büeler, A. Enge, and K. Fukuda Exact volume computation for convex polytopes: A practical study G. Kalai, G. Ziegler, Polytopes, Combinatorics and Computation DMV-Seminar vol. 29 2000 Birkhauser Verlag
4. J. Cohen, and T. Hickey Two algorithms for determining volumes of convex polyhedra J. ACM 26 3 1979 401 414
5. B.C. Eaves, and R.M. Freund Optimal scaling of balls and polyhedra Math. Programming 23 1982 138 147
6. R.M. Freund, and J.B. Orlin On the complexity of four polyhedral set containment problems Math. Programming 33 1985 139 145
7. K. Fukuda Polyhedral computation FAQ, Both html and ps versions available from http://www.ifor.math.ethz.ch/~fukuda/fukuda.html
8. K. Fukuda cdd/cdd+ Reference Manual, Institute for Operations Research ETH-Zentrum http://www.ifor.math.ethz.ch/~fukuda/cdd-home/cdd.html 0.61 (cdd) 0.76 (cdd+) edition, December 1997
9. J.E. Goodman, and Joseph O'Rourke Handbook of Discrete and Computational Geometry Discrete Mathematics and Its Applications 1997 CRC Press New York
10. P. Gritzmann, and V. Klee Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces Math. Programming 59 1993 163 213
11. P. Gritzmann, and V. Klee On the complexity of some basic problems in computational convexity: I. Containment problems Discrete Math. 136 1994 129 174
12. NAG Numerical Algorithms Group Ltd., The MathWorks Inc. http://www.nag.com NAG Foundation Toolbox - For Use with MATLAB, 1995
13. Y. Nesterov, and A. Nemirovskii Interior-Point Polynomial Algorithms in Convex Programming, Studies in Applied Mathematics 1994 SIAM Philadelphia
14. J.-R. Sack, and J. Urrutia Handbook of Computational Geometry 2000 North-Holland Amsterdam
15. F.D. Torrisi, and A. Bemporad Discrete-time hybrid modeling and verification Proc. 40th IEEE Conf. on Decision and Control 2001 2899 2904
16. B. Zhu Approximating convex polyhedra with axis-parallel boxes Internat. J. Comput. Geom. Appl. 7 3 1997 253 267
17. G.M. Ziegler Lectures on Polytopes 1995 Springer-Verlag Berlin