A triangulation of the 6-cube with 308 simplices

DOI10.1016/0012-365X(93)90339-UzbMath0784.52012OpenAlexW1972135515MaRDI QIDQ686174

Robert B. Hughes, Michael R. Anderson

Publication date: 1 November 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90339-u

zbMATH Keywords

triangulationsimplexdissection

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05)

Related Items

A lower bound for the simplexity of the \(n\)-cube via hyperbolic volumes, What is known about unit cubes, Simplexity of the cube, Subdivision of simplices relative to a cutting plane and finite concave minimization

Cites Work

• Minimum-cardinality triangulations of the \(d\)-cube for \(d=5\) and \(d=6\)
• A simple and relatively efficient triangulation of the n-cube
• Some remarks on triangulating a d-cube
• Unsolved problems in geometry
• Extensions of Lemke's algorithm for the linear complementarity problem
• The Middle-Cut Triangulations of the n-Cube