Asymptotically efficient triangulations of the \(d\)-cube

DOI10.1007/s00454-003-2845-5zbMath1042.52009arXivmath/0204157OpenAlexW3121701042MaRDI QIDQ1422223

David Orden, Francisco Santos

Publication date: 5 February 2004

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

Full work available at URL: https://arxiv.org/abs/math/0204157

zbMATH Keywords

triangulationspolyhedral subdivisionlattice polytope\(d\)-cubesimplicial dissection

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11)

Related Items

Flag arrangements and triangulations of products of simplices, Tropical hyperplane arrangements and oriented matroids, Parallel enumeration of triangulations, Edge detection by adaptive splitting, Lattice Delone simplices with super-exponential volume, Properties of the multidimensional finite elements, Uniform tree approximation by global optimization techniques, Products of foldable triangulations, A Lower Bound Technique for Triangulations of Simplotopes, Representation complexity of adaptive 3D distance fields, Acyclic systems of permutations and fine mixed subdivisions of simplices, Dyck path triangulations and extendability, Lower bounds for the simplexity of the \(n\)-cube, What is known about unit cubes, Edge detection by adaptive splitting. II: The three-dimensional case, Incidence Simplicial Matrices Formalized in Coq/SSReflect

Cites Work

• A simple and relatively efficient triangulation of the n-cube
• The computation of fixed points and applications
• Simplexity of the cube
• The polytope of all triangulations of a point configuration
• A lower bound for the simplexity of the \(n\)-cube via hyperbolic volumes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item