A triangulation of the 6-cube with 308 simplices

DOI10.1016/0012-365X(93)90339-UMaRDI QIDQ686174zbMATH OpenOpenAlexFDO

Authors 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

simplextriangulationdissection

Mathematics Subject Classification ID

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

Recommendations

• A simple and relatively efficient triangulation of the n-cube
• The almost simple cubical polytopes
• ON THE NUMBER OF TRIANGULATION SIMPLEXES
• Triangulations of simplicial polytopes
• \(n\)-cubes inscribed in simplices
• Lattice 3-polytopes with six lattice points
• Some remarks on triangulating a d-cube
• Cubic partial cubes from simplicial arrangements
• The six-dimensional Delaunay polytopes
• scientific article; zbMATH DE number 3917142

Cites work

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

Cited in

(6)

• On the topology of the number 64
• Simplexity of the cube
• Subdivision of simplices relative to a cutting plane and finite concave minimization
• What is known about unit cubes
• 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\)

This page was built for publication: A triangulation of the 6-cube with 308 simplices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686174)