REFERENCES
- H. L. Bodlaender, P. Gritzmann, V. Klee, and J. van Leeuwen, Computational complexity of norm-maximization, Combinatorica 10 (1990), 203–225.
- T. Bonnesen and W. Fenchel, Theorie der Konvexen Körper, Springer, Berlin, 1934, Reprint: Chelsea Publ. Co., New York, 1948, Translation: BCS Associates, Moscow, Idaho, 1987.
- A Brønsted, An Introduction to Convex Polytopes, Springer, New York, 1983.
- R. C. Buck, Partition of space, Amer. Math. Monthly 50 (1943), 541–544.
- T. Burger and P. Gritzmann, Finding optimal shadows of polytopes, in preparation, 1996.
- H. G. Eggleston, Convexity, Cambridge Univ. Press, 1958.
- M. R. Garey and D. S. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
- P. Gritzmann and A. Hufnagel, A polynomial time algorithm for Minkowski reconstruction, Proc. 11th Ann. Symp. Comp. Geom., Association Comput. Mach., 1995, pp. 1–9.
- P. Gritzmann and V. Klee, On the 0–1 maximization of positive definite quadratic forms, Operations Research Proceedings (D. Pressmar et al., eds.), Deutsche Gesellschaft für Operations Research, Springer, Berlin, 1989, pp. 222–227.
- P. Gritzmann and V. Klee, Inner and outer j-radii of convex bodies in finite-dimensional normed spaces, Discrete Comput. Geom. 7 (1992), 255–280.
- P. Gritzmann and V. Klee, Some basic problems in computational convexity: II. Volume and mixed volumes, In: Polytopes: Abstract, Convex and Computational (T. Bisztriczky, P. McMullen, R. Schneider, and A. Ivic Weiss, eds.), Kluwer, Boston, 1994, pp. 373–466.
- B. Grünbaum, Convex Polytopes, Wiley-Interscience, London, 1967.
- H. Martini, Some characterizing properties of the simplex, Geom. Dedicata 29 (1989), 1–6.
- H. Martini, A new view on some characterizations of simplices, Arch. Math. 55 (1990), 389–393.
- H. Martini, Cross-sectional measures, Coll. Math. Soc. J. Bolyai, North-Holland, Amsterdam, 1994, pp. 269–310.
- H. Martini and B. Weissbach, Zur besten Beleuchtung konvexer Polyeder, Beitr., Algebra Geom. 17 (1984), 151–168.
- H. Martini and B. Weissbach, On quermasses of simplices, Studia Sci. Math. Hung. 27 (1992), 213–222.
- M. McKenna and R. Seidel, Finding the optimal shadow of a convex polytope. Proc. 1st Symp. Comp. Geom., Association Comput. Mach., 1985, pp. 24–28.
- P. McMullen, The maximum number of faces of a convex polytope, Mathematika 17 (1970), 179–184.
- P. McMullen and G. C. Shephard, Convex Polytopes and the Upper Bound Conjecture, Cambridge Univ. Press, 1971.
- H. Minkowski, Allgemeine Lehrsätze über die konvexen Polyeder, Nachr. Ges. Wiss. Göttingen (1897), 198–219.
- H. Minkowski, Volumen und Oberfläche, Math. Ann. 57 (1903), 447–495.
- C. A. Rogers and G. C. Shephard, The difference body of a convex body, Arch. Math. 8 (1957), 220–233.
- R. Schneider, Convex Bodies: The Brunn-Minkowski Theory, Encyclopedia of Mathematics and its Applications, vol. 44, Cambridge Univ. Press, 1993.
- A. Schrijver, Theory of Linear and Integer Programming, Wiley-Interscience, New York, 1986.
- T. Zaslavsky, Facing up to Arrangements: Face-Count Formulas for Partitions of Space by Hyperplanes, American Mathematical Society Memoirs, vol. 154, Amer. Math. Soc., 1975.
- G. M. Ziegler, Lectures on Polytopes, Graduate Texts in Mathematics, vol. 152, Springer-Verlag, New York—Berlin—Heidelberg, 1995.