V. de Haan
- There are only two nonobtuse binary triangulations of the unit n-cube
- Computational Geometry
- Volume | Issue number
- 46 | 3
- Pages (from-to)
- Document type
- Faculty of Science (FNWI)
- Korteweg-de Vries Institute for Mathematics (KdVI)
Triangulations of the cube into a minimal number of simplices without additional vertices have been studied by several authors over the past decades. For 3 ≤ n ≤ 7 this so-called simplexity of the unit cube In is now known to be 5,16,67,308,1493, respectively. In this paper, we study triangulations of In with simplices that only have nonobtuse dihedral angles. A trivial example is the standard triangulation into n! simplices. In this paper we show that, surprisingly, for each n ≥ 3 there is essentially only one other nonobtuse triangulation of In, and give its explicit construction. The number of nonobtuse simplices in this triangulation is equal to the smallest integer larger than n!(e−2).
- go to publisher's site
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.