The Middle-Cut Triangulations of the n-Cube
From MaRDI portal
Publication:3331832
DOI10.1137/0605039zbMath0543.52004OpenAlexW2002604535MaRDI QIDQ3331832
Publication date: 1984
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0605039
Related Items (17)
Identification of piecewise affine models in noisy environment ⋮ A better triangulation for Wright's \(2^n\)-ray algorithm ⋮ Generalized Sperner lemma and subdivisions into simplices of equal volume ⋮ JAX-DIPS: neural bootstrapping of finite discretization methods and application to elliptic problems with discontinuities ⋮ A lower bound for the simplexity of the \(n\)-cube via hyperbolic volumes ⋮ Geometric integration over irregular domains with application to level-set methods ⋮ On \(0/1\)-polytopes with nonobtuse triangulations ⋮ Robust second-order accurate discretizations of the multi-dimensional Heaviside and Dirac delta functions ⋮ Minimum-cardinality triangulations of the \(d\)-cube for \(d=5\) and \(d=6\) ⋮ A triangulation of the 6-cube with 308 simplices ⋮ The \(D_ 2\)-triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations ⋮ Probability density function estimation with the frequency polygon transform ⋮ What is known about unit cubes ⋮ A Consistent Analytical Formulation for Volume Estimation of Geometries Enclosed by Implicitly Defined Surfaces ⋮ Simplexity of the cube ⋮ A note on triangulating the 5-cube ⋮ A simple and relatively efficient triangulation of the n-cube
Cites Work
- A triangulation of the n-cube
- Minimal triangulation of the 4-cube
- A note on minimal triangulations of an n-cube
- The computation of fixed points and applications
- Triangulations for the cube
- The Approximation of Fixed Points of a Continuous Mapping
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The Middle-Cut Triangulations of the n-Cube
