It is known that the 4-dimensional cube can be triangulated by a set of 16 simplices. This note demonstrates that the 4-dimensional cube cannot be triangulated with fewer than 16 simpiices.
โฆ LIBER โฆ
Asymptotically Efficient Triangulations of thed-Cube
โ Scribed by David Orden; Francisco Santos
- Publisher
- Springer
- Year
- 2003
- Tongue
- English
- Weight
- 318 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0179-5376
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Minimal triangulation of the 4-cube
โ
Richard W. Cottle
๐
Article
๐
1982
๐
Elsevier Science
๐
English
โ 447 KB
A note on minimal triangulations of an n
โ
John F. Sallee
๐
Article
๐
1982
๐
Elsevier Science
๐
English
โ 219 KB
A triangulation of the 6-cube with 308 s
โ
Robert B. Hughes; Michael R. Anderson
๐
Article
๐
1993
๐
Elsevier Science
๐
English
โ 243 KB
We give a triangulation of the 6-cube into 308 simplices; this is the smallest number in any triangulation of I6 presented so far.
Lower Bounds for Simplicial Covers and T
โ
Adam Bliss; Francis Edward Su
๐
Article
๐
2004
๐
Springer
๐
English
โ 261 KB
TheD2-triangulation for simplicial homot
โ
Chuangyin Dang
๐
Article
๐
1993
๐
Springer-Verlag
๐
English
โ 886 KB
Asymptotic properties of some triangulat
โ
N. Boal; V. Domรญnguez; F.-J. Sayas
๐
Article
๐
2008
๐
Elsevier Science
๐
English
โ 206 KB
In this paper we analyse a method for triangulating the sphere originally proposed by Baumgardner and Frederickson in 1985. The method is essentially a refinement procedure for arbitrary spherical triangles that fit into a hemisphere. Refinement is carried out by dividing each triangle into four by