A note on triangulating the 5-cube
From MaRDI portal
Let \(I^ 5\) denote the 5-cube with vertices \(v(v_ 1,,,,v_ 5)\); \(v_ i\in \{0,1\}\). A vertex v is odd [even] if the sum of its coordinates is odd [even]. A triangulation of \(I^ 5\) consists of simplices whose vertices are also vertices of \(I^ 5\). A complete truncation of \(I^ 5\) is a truncation of \(I^ 5\) at each even [or each odd] vertex. The authors show that a triangulation of \(I^ 5\) using complete truncation can have no less than 67 pieces and no more than 68 pieces.
Recommendations
Cites work
Cited in
(8)- Simplexity of the cube
- A lower bound for the simplexity of the n-cube via hyperbolic volumes
- Placing of points into the \(5\)-dimensional unit cube
- scientific article; zbMATH DE number 2061967 (Why is no real title available?)
- What is known about unit cubes
- Efficient P1-FEM for any space dimension in \textsc{Matlab}
- Minimum-cardinality triangulations of the d-cube for d=5 and d=6
- Some remarks on triangulating a d-cube
This page was built for publication: A note on triangulating the 5-cube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q802144)