A triangulation of the n-cube

DOI10.1016/0012-365X(82)90190-XMaRDI QIDQ1163234zbMATH OpenFDO

Authors John F. Sallee

Publication date 1982

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(82)90190-X

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)

Cites work

• Extensions of Lemke's algorithm for the linear complementarity problem
• scientific article; zbMATH DE number 3141674 (Why is no real title available?)
• scientific article; zbMATH DE number 3182201 (Why is no real title available?)
• scientific article; zbMATH DE number 3669737 (Why is no real title available?)
• scientific article; zbMATH DE number 3219506 (Why is no real title available?)
• scientific article; zbMATH DE number 3261280 (Why is no real title available?)
• Minimal triangulation of the 4-cube
• The Approximation of Fixed Points of a Continuous Mapping
• Triangulations for the cube

Cited in

(21)

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

This page was built for publication: A triangulation of the n-cube

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