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

DOI10.1016/0012-365X(93)90055-XMaRDI QIDQ685587zbMATH OpenWikidataFDO

Authors Robert B. Hughes

Publication date 17 March 1994

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

facesimplextriangulationvertex\(d\)-cubecorner-slicing

Mathematics Subject Classification ID

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

Recommendations

• A note on triangulating the 5-cube
• K₆-minors in triangulations and complete quadrangulations
• On the coverings of the \(d\)-cube for \(d\leq 6\)
• Triangles in C5‐free graphs and hypergraphs of girth six
• A triangulation of the 6-cube with 308 simplices
• The cubical \(d\)-polytopes with fewer than 2\(^{d+1}\) vertices
• -Minors in triangulations on surfaces
• Lower bounds for simplicial covers and triangulations of cubes
• \(K_{6}\) and icosahedron minors in 5-connected projective planar graphs
• scientific article; zbMATH DE number 1076151

Cites work

• scientific article; zbMATH DE number 3917142 (Why is no real title available?)
• scientific article; zbMATH DE number 3804333 (Why is no real title available?)
• A note on minimal triangulations of an n-cube
• A note on triangulating the 5-cube
• A triangulation of the n-cube
• Facet-to-facet implies face-to-face
• Minimal triangulation of the 4-cube
• Some remarks on triangulating a d-cube
• The Middle-Cut Triangulations of the n-Cube
• Triangulations for the cube
• Unsolved problems in geometry

Cited in

(15)

• Efficient P1-FEM for any space dimension in \textsc{Matlab}
• A triangulation of the 6-cube with 308 simplices
• A note on triangulating the 5-cube
• Simplexity of the cube
• There are only two nonobtuse binary triangulations of the unit \(n\)-cube
• Subdivision of simplices relative to a cutting plane and finite concave minimization
• Lower bounds for simplicial covers and triangulations of cubes
• What is known about unit cubes
• On 0/1-polytopes with nonobtuse triangulations
• The Middle-Cut Triangulations of the n-Cube
• A lower bound for the simplexity of the \(n\)-cube via hyperbolic volumes
• Maximal triangulations of a regular prism
• Lower bounds on cube simplexity
• Lower bounds for the simplexity of the n-cube
• Asymptotically efficient triangulations of the \(d\)-cube

This page was built for publication: Minimum-cardinality triangulations of the \(d\)-cube for \(d=5\) and \(d=6\)

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