✦ LIBER ✦

Minimal triangulation of the 4-cube

✍ Scribed by Richard W. Cottle

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 447 KB
Volume: 40
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(82)90185-6

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

A note on minimal triangulations of an n

A note on minimal triangulations of an n-cube

✍ John F. Sallee 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 219 KB

Triangulations for the cube

✍ Patrick Scott Mara 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 384 KB

A triangulation of the 6-cube with 308 s

A triangulation of the 6-cube with 308 simplices

✍ 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.

Minimal roughness property of the Delaun

Minimal roughness property of the Delaunay triangulation

✍ Samuel Rippa 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 590 KB

A note on triangulating the 5-cube

✍ Mark N. Broadie; Richard W. Cottle 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 888 KB

Minimal ordered triangulations of surfac

Minimal ordered triangulations of surfaces

✍ Zlatan Magajna; Bojan Mohar; Tomaž Pisanski 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 453 KB