Construction techniques for cubical complexes, odd cubical 4-polytopes, and prescribed dual manifolds. (English) Zbl 1110.52015

Summary: We provide a number of new construction techniques for cubical complexes and cubical polytopes, and thus for cubifications (hexahedral mesh generation). As an application we obtain an instance of a cubical 4-polytope that has a nonorientable dual manifold (a Klein bottle). This confirms an existence conjecture of Hetyei (1995).
More systematically, we prove that every normal crossing codimension one immersion of a compact 2-manifold into \(\mathbb R^3\) is PL-equivalent to a dual manifold immersion of a cubical 4-polytope. As an instance we obtain a cubical 4-polytope with a cubification of Boy’s surface as a dual manifold immersion, and with an odd number of facets. Our explicit example has 17,718 vertices and 16,533 facets. Thus we get a parity-changing operation for three-dimensional cubical complexes (hex meshes); this solves problems of Eppstein, Thurston, and others.


52B12 Special polytopes (linear programming, centrally symmetric, etc.)
52B11 \(n\)-dimensional polytopes
52B05 Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.)
57Q05 General topology of complexes


polymake; JavaView
Full Text: DOI arXiv Euclid EuDML Link


[1] Akhmetev P. M., St. Petersburg Math. J. 7 pp 749– (1996)
[2] Apéry F., Models of the Real Projective Plane. (1987) · Zbl 0623.57001
[3] DOI: 10.1016/S0012-365X(99)00285-X · Zbl 0947.52004
[4] DOI: 10.1090/S0002-9939-1974-0377897-1
[5] DOI: 10.1007/s003660200016 · Zbl 01993865
[6] DOI: 10.1007/BF02574013 · Zbl 0807.52009
[7] DOI: 10.1007/BF01444342 · JFM 34.0537.07
[8] Bruns W., J. Reine Angew. Math. 485 pp 123– (1997)
[9] DOI: 10.1070/IM1995v044n02ABEH001598 · Zbl 0880.57010
[10] DOI: 10.1016/S0925-7721(98)00032-7 · Zbl 0922.68120
[11] DOI: 10.1007/BF01344542 · Zbl 0272.52001
[12] Francis G., Mathematical Visualization (Berlin, 1997) pp 237– (1998)
[13] DOI: 10.1007/BF02566085 · Zbl 0404.57011
[14] Gawrilow E., ”polymake: A framework for Analyzing Convex Polytopes.” (1997) · Zbl 0960.68182
[15] Goodman-Strauss C., Discrete Geometry: In Honor of W. Kuperberg’s 60th Birthday pp 305– (2003)
[16] DOI: 10.1007/978-1-4613-0019-9_16
[17] Heckenbach F., ”Die Möbiusfunktion und Homologien auf partiell geordneten Mengen.” (1997)
[18] DOI: 10.1007/BF02570709 · Zbl 0834.57015
[19] Hilbert D., Anschauliche Geometrie, (1932)
[20] Hudson J. F. P., Piecewise Linear Topology. (1969) · Zbl 0189.54507
[21] DOI: 10.1007/BF02189315 · Zbl 0771.52005
[22] DOI: 10.1007/s004540010039 · Zbl 1066.52012
[23] Kempf G. R., Toroidal Embeddings I (1973) · Zbl 0271.14017
[24] Mitchell, S. A. ”A Characterization of the Quadrilateral Meshes of a Surface which Admit a Compatible Hexahedral Mesh of the Enclosed Volume.”. Proc. 13th Symp. Theoretical Aspects of Computer Science (STACS1996). pp.465–476. Heidelberg: Springer. [Mitchell 96], Lecture Notes in Computer Science 1046 · Zbl 1380.65043
[25] Morin B., C. R. Acad. Sci. Paris, Sér. A-B 287 (13) pp A879– (1978)
[26] Munkres J. R., Elements of Algebraic Topology. (1984) · Zbl 0673.55001
[27] Petit J. -P., Das Topologikon. (1995)
[28] Polthier K., JavaView Visualization Software (1999)
[29] Rourke C., Introduction to Piecewise-Linear Topology. (1972) · Zbl 0254.57010
[30] Schwartz A., PhD diss., in: ”Constructions of Cubical Polytopes.” (2003)
[31] DOI: 10.1112/S0025579300003958 · Zbl 0146.44302
[32] DOI: 10.1090/S0002-9947-1959-0104227-9
[33] Thurston W., Posting to sci. math (1993)
[34] DOI: 10.1007/s003660200019 · Zbl 01993868
[35] Yusin B. V., Proc. Amer. Math. Soc. 92 pp 578– (1984)
[36] DOI: 10.1007/978-1-4613-8431-1 · Zbl 0823.52002
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.