Simplexity of the cube

DOI10.1016/0012-365X(95)00075-8zbMath0862.52005MaRDI QIDQ1815315

Robert B. Hughes, Michael R. Anderson

Publication date: 25 May 1997

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

zbMATH Keywords

triangulationsunit cube

Mathematics Subject Classification ID

Linear programming (90C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items

Products of foldable triangulations, An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty, A linear programming approach to difference-of-convex piecewise linear approximation, A Lower Bound Technique for Triangulations of Simplotopes, Simplicial isosurfacing in arbitrary dimension and codimension, Asymptotically efficient triangulations of the \(d\)-cube, A lower bound for the simplexity of the \(n\)-cube via hyperbolic volumes, On \(0/1\)-polytopes with nonobtuse triangulations, Lower bounds for the simplexity of the \(n\)-cube, What is known about unit cubes, Piecewise-linear approximations of multidimensional functions, Convex envelopes for edge-concave functions, Properties, extensions and application of piecewise linearization for Euclidean norm optimization in \(\mathbb{R}^2\), Assymptotically efficient triangulations of the d-cube∗

Cites Work

• Unnamed Item
• Minimum-cardinality triangulations of the \(d\)-cube for \(d=5\) and \(d=6\)
• A triangulation of the 6-cube with 308 simplices
• A note on triangulating the 5-cube
• A simple and relatively efficient triangulation of the n-cube
• Some remarks on triangulating a d-cube
• 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
• Extensions of Lemke's algorithm for the linear complementarity problem
• Triangulations for the cube
• Lower bounds on cube simplexity
• The Middle-Cut Triangulations of the n-Cube
• On the Value of Determinants
• The Hadamard Maximum Determinant Problem