A simple and relatively efficient triangulation of the n-cube

DOI10.1007/BF02574690zbMATH Open0727.68044MaRDI QIDQ804290FDOQ804290

Publication date: 1991

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131159

Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)

Cites Work

Decompositions of Rational Convex Polytopes
Title not available (Why is that?)
The computation of fixed points and applications
Title not available (Why is that?)
A triangulation of the n-cube
The Middle-Cut Triangulations of the n-Cube
Title not available (Why is that?)
Minimal triangulation of the 4-cube

Cited In (29)

Assymptotically efficient triangulations of the d-cube∗
A triangulation of the 6-cube with 308 simplices
The \(D_ 2\)-triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations
Some remarks on triangulating a d-cube
A Lower Bound Technique for Triangulations of Simplotopes
Simplexity of the cube
Subdivision of simplices relative to a cutting plane and finite concave minimization
Many triangulated spheres
What is known about unit cubes
Lattice Delone simplices with super-exponential volume
A subdivision algebra for a product of two simplices via flow polytopes
Tropical hyperplane arrangements and oriented matroids
Dyck path triangulations and extendability
Flag arrangements and triangulations of products of simplices
Convex envelopes for edge-concave functions
Equivalence classes of full-dimensional 0/1-polytopes with many vertices
Nonregular triangulations of products of simplices
A lower bound for the simplexity of the \(n\)-cube via hyperbolic volumes
Simplicial isosurfacing in arbitrary dimension and codimension
Title not available (Why is that?)
The geometry of products of minors
A better triangulation for Wright's \(2^n\)-ray algorithm
How good are convex hull algorithms?
Lower bounds for the simplexity of the \(n\)-cube
Computing Bayes-Nash Equilibria in Combinatorial Auctions with Verification
Identification of piecewise affine models in noisy environment
Acyclic systems of permutations and fine mixed subdivisions of simplices
Asymptotically efficient triangulations of the \(d\)-cube
Probability density function estimation with the frequency polygon transform

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)