Lower bounds for simplicial covers and triangulations of cubes

DOI10.1007/s00454-004-1128-0zbMath1078.52013arXivmath/0310142OpenAlexW1964199832MaRDI QIDQ2484008

Francis Edward Su, Adam Bliss

Publication date: 2 August 2005

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

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

zbMATH Keywords

triangulationpolytopedissectionsimplicial cover

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Polyhedra and polytopes; regular figures, division of spaces (51M20) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items (9)

Edge detection by adaptive splitting ⋮ Uniform tree approximation by global optimization techniques ⋮ Products of foldable triangulations ⋮ Čech type approach to computing homology of maps ⋮ A Lower Bound Technique for Triangulations of Simplotopes ⋮ Representation complexity of adaptive 3D distance fields ⋮ Lower bounds for the simplexity of the \(n\)-cube ⋮ Edge detection by adaptive splitting. II: The three-dimensional case ⋮ Force-stepping integrators in Lagrangian mechanics

This page was built for publication: Lower bounds for simplicial covers and triangulations of cubes