A simple and relatively efficient triangulation of the n-cube
From MaRDI portal
Publication:804290
DOI10.1007/BF02574690zbMath0727.68044MaRDI QIDQ804290
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)
Related Items
Identification of piecewise affine models in noisy environment, Flag arrangements and triangulations of products of simplices, How good are convex hull algorithms?, Tropical hyperplane arrangements and oriented matroids, A better triangulation for Wright's \(2^n\)-ray algorithm, Nonregular triangulations of products of simplices, Lattice Delone simplices with super-exponential volume, A Lower Bound Technique for Triangulations of Simplotopes, Simplicial isosurfacing in arbitrary dimension and codimension, Acyclic systems of permutations and fine mixed subdivisions of simplices, Asymptotically efficient triangulations of the \(d\)-cube, Computing Bayes-Nash Equilibria in Combinatorial Auctions with Verification, A lower bound for the simplexity of the \(n\)-cube via hyperbolic volumes, Dyck path triangulations and extendability, 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, Lower bounds for the simplexity of the \(n\)-cube, What is known about unit cubes, Convex envelopes for edge-concave functions, Equivalence classes of full-dimensional 0/1-polytopes with many vertices, Simplexity of the cube, Subdivision of simplices relative to a cutting plane and finite concave minimization, The geometry of products of minors, Assymptotically efficient triangulations of the d-cube∗
Cites Work
