A note on minimal triangulations of an n-cube
From MaRDI portal
Publication:1166776
DOI10.1016/0166-218X(82)90041-5zbMath0489.52006MaRDI QIDQ1166776
Publication date: 1982
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
51M20: Polyhedra and polytopes; regular figures, division of spaces
52A20: Convex sets in (n) dimensions (including convex hypersurfaces)
Related Items
What is known about unit cubes, Minimum-cardinality triangulations of the \(d\)-cube for \(d=5\) and \(d=6\), Some computational methods for systems of nonlinear equations and systems of polynomial equations, Lower bounds on cube simplexity, Lower bounds for the simplexity of the \(n\)-cube, Simplexity of the cube, A lower bound for the simplexity of the \(n\)-cube via hyperbolic volumes, The Middle-Cut Triangulations of the n-Cube
Cites Work