A simple and relatively efficient triangulation of the n-cube
From MaRDI portal
Publication:804290
Cites work
- scientific article; zbMATH DE number 3911182 (Why is no real title available?)
- scientific article; zbMATH DE number 3983158 (Why is no real title available?)
- scientific article; zbMATH DE number 4095658 (Why is no real title available?)
- A triangulation of the n-cube
- Decompositions of Rational Convex Polytopes
- Minimal triangulation of the 4-cube
- The Middle-Cut Triangulations of the n-Cube
- The computation of fixed points and applications
Cited in
(29)- Simplexity of the cube
- Flag arrangements and triangulations of products of simplices
- Tropical hyperplane arrangements and oriented matroids
- scientific article; zbMATH DE number 3917142 (Why is no real title available?)
- The geometry of products of minors
- Some remarks on triangulating a d-cube
- Computing Bayes-Nash Equilibria in Combinatorial Auctions with Verification
- A better triangulation for Wright's \(2^n\)-ray algorithm
- Convex envelopes for edge-concave functions
- Subdivision of simplices relative to a cutting plane and finite concave minimization
- Equivalence classes of full-dimensional 0/1-polytopes with many vertices
- A subdivision algebra for a product of two simplices via flow polytopes
- Nonregular triangulations of products of simplices
- Identification of piecewise affine models in noisy environment
- A triangulation of the 6-cube with 308 simplices
- The \(D_ 2\)-triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations
- Acyclic systems of permutations and fine mixed subdivisions of simplices
- Lattice Delone simplices with super-exponential volume
- Lower bounds for the simplexity of the \(n\)-cube
- Many triangulated spheres
- A lower bound for the simplexity of the \(n\)-cube via hyperbolic volumes
- Simplicial isosurfacing in arbitrary dimension and codimension
- Asymptotically efficient triangulations of the \(d\)-cube
- A lower bound technique for triangulations of simplotopes
- What is known about unit cubes
- Assymptotically efficient triangulations of the d-cube∗
- Dyck path triangulations and extendability
- Probability density function estimation with the frequency polygon transform
- How good are convex hull algorithms?
This page was built for publication: A simple and relatively efficient triangulation of the n-cube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804290)
