A triangulation of the n-cube

DOI10.1016/0012-365X(82)90190-XzbMath0483.52003MaRDI QIDQ1163234

John F. Sallee

Publication date: 1982

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

zbMATH Keywords

minimum number of n-simplicestriangulation of cubes

Mathematics Subject Classification ID

Fixed-point theorems (47H10) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Polytopes and polyhedra (52Bxx)

Related Items

Identification of piecewise affine models in noisy environment, A better triangulation for Wright's \(2^n\)-ray algorithm, Bayesian inference over ICA models: application to multibiometric score fusion with quality estimates, A Lower Bound Technique for Triangulations of Simplotopes, Simplicial isosurfacing in arbitrary dimension and codimension, Minimal triangulation of the 4-cube, A note on minimal triangulations of an n-cube, 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\), Probability density function estimation with the frequency polygon transform, The hyperdeterminant and triangulations of the 4-cube, Lower bounds for the simplexity of the \(n\)-cube, $J'$: A New Triangulation of $R^n $, The Middle-Cut Triangulations of the n-Cube, What is known about unit cubes, Extensions of functions of 0-1 variables and applications to combinatorial optimization, Convex envelopes for edge-concave functions, Simplexity of the cube, Unique representation in convex sets by extraction of marked components, A note on triangulating the 5-cube, A simple and relatively efficient triangulation of the n-cube

Cites Work

• Minimal triangulation of the 4-cube
• Extensions of Lemke's algorithm for the linear complementarity problem
• Triangulations for the cube
• The Approximation of Fixed Points of a Continuous Mapping
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item