Decomposability of Polytopes

Discrete & Computational Geometry - Tập 39 - Trang 460-468 - 2008
Krzysztof Przesławski1, David Yost2
1Faculty of Mathematics, Computer Science and Econometrics, University of Zielona Góra, Zielona Góra, POLAND
2School of Information Technology and Mathematical Sciences, University of Ballarat, Ballarat, Australia

Tóm tắt

A known characterization of the decomposability of polytopes is reformulated in a way which may be more computationally convenient, and a more transparent proof is given. New sufficient conditions for indecomposability are then deduced, and illustrated with some examples.

Tài liệu tham khảo

Gale, D.: Irreducible convex sets. In: Proc. International Congress of Mathematicians, Amsterdam, vol. 2, pp. 217–218 (1954) Kallay, M.: Indecomposable polytopes. Isr. J. Math. 41, 235–243 (1982) McMullen, P.: Indecomposable convex polytopes. Isr. J. Math. 58, 321–323 (1987) Meyer, W.J.: Indecomposable polytopes. Trans. Am. Math. Soc. 190, 77–86 (1974) Shephard, G.C.: Decomposable convex polytopes. Mathematika 10, 89–95 (1963) Smilansky, Z.: Decomposability of polytopes and polyhedra. Geom. Dedicata 24, 29–49 (1987) Yost, D.: Irreducible convex sets. Mathematika 38, 134–155 (1991) Ziegler, G.M.: Lectures on Polytopes. Graduate Texts in Mathematics, vol. 152. Springer, New York (1995)