Extremal properties for dissections of convex 3-polytopes

SIAM Journal on Discrete Mathematics

Volumn 14, Issue 2, 2001, Pages 143-161

  De Loera, Jesús A ^a   Santos, Francisco ^b   Takeuchi, Fumihiko ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Universidat de Cantabria   (Spain)

^c UNIVERSITY OF TOKYO   (Japan)

Author keywords

Antiprism; Archimedean solid; Combinatorial d cube; Dissection; Lattice polytope; Mismatched region; Prism; Triangulation

Indexed keywords

EID: 0000657027     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480199366238     Document Type: Article

References (30)

1. N. AMENTA AND G.M. ZIEGLER, Deformed products and maximal shadows of polytopes, in Advances in Discrete and Computational Geometry, B. Chazelle, J.E. Goodman, and R. Pollack, eds., Contemp. Math. 223, AMS, Providence, RI, 1999, pp. 57-90.
2. A. BARVINOK AND J. POMMERSHEIM, An algorithmic theory of lattice points in polyhedra, in New Perspectives in Algebraic Combinatorics, Math. Sci. Res. Inst. Publ. 38, Cambridge University Press, Cambridge, UK, 1999.
3. L. BILLERA, P. FILLIMAN, AND B. STURMFELS, Constructions and complexity of secondary polytopes, Adv. Math., 83 (1990), pp. 155-179.
4. A. BELOW, U. BREHM, J.A. DE LOERA, AND J. RICHTER-GEBERT, Minimal simplicial dissections and triangulations of convex 3-polytopes, Discrete Comput. Geom., 24 (2000), pp. 35-48.
5. W. BRUNS, J. GUBELADSE, AND N.V. TRUNG, Normal polytopes, triangulations and Koszul algebras J. Reine Angew. Math., 485 (1997), pp. 123-160.
6. H.S.M. COXETER, Regular Polytopes, Dover, New York, 1973.
7. G.B DANTZIG, A.J. HOFFMAN, AND T.C. HU, Triangulations (tilings) and certain block triangular matrices, Math. Programming, 31 (1985), pp. 1-14.
8. J.A. DE LOERA, S HOŞTEN, F. SANTOS, AND B. STURMFELS, The polytope of all triangulations of a point configuration, Doc. Math., 1 (1996), pp. 103-119.
9. H. EDELSBRUNNER, F P. PREPARATA, AND D.B. WEST, Tetrahedrizing point sets in three dimensions, J. Symbolic Comput., 10 (1990), pp. 335-347.
10. R.T. FIRLA AND G.M. ZIEGLER, Hilbert bases, unimodular triangulations, and binary covers of rational polyhedral cones, Discrete Comput. Geom., 21 (1999), pp. 205-216.
11. B. GRÜNBAUM, Convex Polytopes, Interscience, London, 1967.
12. M. HAIMAN, A simple and relatively efficient triangulation of the n-cube, Discrete Comput. Geom., 6 (1991), pp. 287-289.
13. B. HUBER, J. RAMBAU, AND F. SANTOS, The Cayley trick, lifting subdivisions and the Bohne-Dress theorem on zonotopal tilings, J. Eur. Math. Soc. (JEMS), 2 (2000), pp. 179-198.
14. R.B. HUGHES AND M.R. ANDERSON, Simplexity of the cube, Discrete Math., 158 (1996), pp. 99-150.
15. J.-M. KANTOR, Triangulations of integral polytopes and Ehrhart polynomials, Beiträge Algebra Geom., 39 (1998), pp. 205-218.
16. J. LAGARIAS AND G.M. ZIEGLER, Unimodular Triangulations, manuscript, 1999.
17. C.W. LEE, Subdivisions and triangulations of polytopes, in Handbook of Discrete and Computational Geometry, J.E. Goodman and J. O'Rourke, eds., CRC Press, Boca Raton, FL, 1997, pp. 271-290.
18. P.S. MARA, Triangulations for the cube, J. Combin. Theory Ser. A, 20 (1976), pp. 170-177.
19. J. RAMBAU, TOPCOM: A Program for Computing All Triangulations of a Point Set, ZIB-Berlin, 1999; also available online from http://wwwzib.de/rambau/TOPCOM.html.
20. J. RICHTER-GEBERT, Realization Spaces of Polytopes, Lecture Notes in Math. 1643, Springer-Verlag, Berlin, 1996.
21. G.L. ROTHSCHILD AND E.G. STRAUS, On triangulations of the convex hull of n points, Combinatorica, 5 (1985), pp. 167-179.
22. F. SANTOS, A point configuration whose space of triangulations is disconnected, J. Amer. Math. Soc., 13 (2000), pp. 611-637.
23. F. SANTOS, Triangulations of oriented matroids, Mem. Amer. Math. Soc., to appear; also available online from http://www.matesco.unican.es/∼santos/Articulos/index.html.
24. A. SEBÖ, Hilbert bases, Carathéodory's theorem and combinatorial optimization, in Integer Programming and Combinatorial Optimization, R. Kannan and W. Pulleyblank, eds., Math. Programming Society, University of Waterloo Press, Waterloo, Ontario, Canada, 1990, pp. 431-456.
25. A. SEBÖ, An Introduction to Empty Lattice Simplices, manuscript; also available online from http://cosmos.imag.fr/DMD/OPTICOMB/Membres/sebo/sebo.html.
26. W.D. SMITH, A lower bound for the simplexity of the n-cube via hyperbolic volumes, European J. Combin., 21 (2000), pp. 131-137.
27. A. TAJIMA, Optimality and integer programming formulations of triangulations in general dimension, in Proceedings of 9th Annual International Symposium on Algorithms and Computation (ISAAC '98), K.-Y. Chwa and O.H. Ibarra, eds., Lecture Notes in Comput. Sci. 1533, Springer-Verlag, Berlin, pp. 377-386.
28. A. TAJIMA, Optimizing Geometric Triangulations by Using Integer Programming, Ph.D. thesis, University of Tokyo, Tokyo, Japan 2000; also available online from http://www-imai.is.s.u-tokyo.ac.jp/∼akira/papers/dissertation.pdf.
29. F TAKEUCHI AND H. IMAI. Enumerating triangulations for products of two simplices and for arbitrary configurations of points, in Proceedings of 3rd Annual International Conference on Computing and Combinatorics (COCOON '97), T. Jiang and D T. Lee, eds., Lecture Notes in Comput. Sci. 1276, Springer-Verlag, Berlin, pp. 470-481.
30. G.M. ZIEGLER, Lectures on Polytopes, Springer-Verlag, New York, 1995.