Abstract
Let $P$ and $Q$ be polytopes, the first of “low” dimension and the second of “high” dimension. We show how to triangulate the product $P \times Q$ efficiently (i.e., with few simplices) starting with a given triangulation of $Q$. Our method has a computational part, where we need to compute an efficient triangulation of $P \times \Delta^m$, for a (small) natural number $m$ of our choice. $\Delta^m$ denotes the $m$-simplex. Our procedure can be applied to obtain (asymptotically) efficient triangulations of the cube $I^n$: We decompose $I^n = I^k \times I^{n-k}$, for a small $k$. Then we recursively assume we have obtained an efficient triangulation of the second factor and use our method to triangulate the product. The outcome is that using $k=3$ and $m=2$, we can triangulate $I^n$ with $O(0.816^{n} n!)$ simplices, instead of the $O(0.840^{n} n!)$ achievable before.
Article PDF
Similar content being viewed by others
References
R. Anderson, B. Hughes, Simplexity of the cube, Discrete Math 158 (1996), 99–150.
A. Below, J. A. de Loera, J. Richter-Gebert, Finding minimal triangulations of convex 3-polytopes is NP-hard, in Proceedings of the Eleventh Annual ACM–SIAM Symposium on Discrete Algorithms 2000, San Francisco, California, United States, ACM Press, New York, 2000, pp. 65–66.
J. A. de Loera, S. Hosten, F. Santos, B. Sturmfels, The polytope of all triangulations of a point configuration, Doc. Math., 1 (1996), 103–119.
J. A. de Loera, S. Peterson, universalbuilder. Software available at http://www.math.ucdavis.edu/~deloera/RECENT\_WORK/universalbuilder.tar.gz
I. M. Gel’fand, M. M. Kapranov, A. V. Zelevinsky, Multidimensional Determinants, Discriminants and Resultants, Birkhäuser, Boston, 1994.
H. Haiman, A simple and relatively efficient triangulation of the n-cube, Discrete Comput. Geom., 6 (1991), 287–289.
B. Huber J. Rambau F. Santos (2000) ArticleTitleThe Cayley Trick, lifting subdivisions and the Bohne–Dress Theorem on zonotopal tilings J. European Math. Soc. 2 179–198 Occurrence Handle10.1007/s100970050003 Occurrence Handle2001i:52017 Occurrence Handle1009.68534
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, New York, 1997, pp. 271–290.
W. D. Smith (2000) ArticleTitleA lower bound for the simplexity of the N-cube via hyperbolic volumes European J. Combin. 21 131–137 Occurrence Handle10.1006/eujc.1999.0327 Occurrence Handle2001c:52004 Occurrence Handle0982.51015
M. J. Todd, The Computation of Fixed Points and Applications, Lecture Notes in Economics and Mathematical Systems, Vol. 124, Springer-Verlag, Berlin, 1976.
P. Whittle, Probability via Expectation, 3rd edition, Texts in Statistics, Springer-Verlag, Berlin, 1992.
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Orden, D., Santos, F. Asymptotically Efficient Triangulations of the d-Cube. Discrete Comput Geom 30, 509–528 (2003). https://doi.org/10.1007/s00454-003-2845-5
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-003-2845-5