Minimum-cardinality triangulations of the \(d\)-cube for \(d=5\) and \(d=6\)

DOI10.1016/0012-365X(93)90055-XzbMath0783.52010WikidataQ127884460 ScholiaQ127884460MaRDI QIDQ685587

Robert B. Hughes

Publication date: 17 March 1994

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

zbMATH Keywords

facetriangulationsimplexvertex\(d\)-cubecorner-slicing

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07)

Related Items

Lower bounds on cube simplexity, A lower bound for the simplexity of the \(n\)-cube via hyperbolic volumes, On \(0/1\)-polytopes with nonobtuse triangulations, A triangulation of the 6-cube with 308 simplices, What is known about unit cubes, Simplexity of the cube, Subdivision of simplices relative to a cutting plane and finite concave minimization

Cites Work

• Unnamed Item
• Unnamed Item
• A note on triangulating the 5-cube
• Some remarks on triangulating a d-cube
• Facet-to-facet implies face-to-face
• A triangulation of the n-cube
• Minimal triangulation of the 4-cube
• A note on minimal triangulations of an n-cube
• Unsolved problems in geometry
• Triangulations for the cube
• The Middle-Cut Triangulations of the n-Cube