A note on minimal triangulations of an n-cube
From MaRDI portal
Publication:1166776
DOI10.1016/0166-218X(82)90041-5zbMath0489.52006OpenAlexW1986198568MaRDI QIDQ1166776
Publication date: 1982
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(82)90041-5
Polyhedra and polytopes; regular figures, division of spaces (51M20) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items (8)
Lower bounds on cube simplexity ⋮ A lower bound for the simplexity of the \(n\)-cube via hyperbolic volumes ⋮ 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 for the simplexity of the \(n\)-cube ⋮ The Middle-Cut Triangulations of the n-Cube ⋮ What is known about unit cubes ⋮ Simplexity of the cube
Cites Work
This page was built for publication: A note on minimal triangulations of an n-cube
