2009/01/31 by Sven Herrmann, Michael Joswig
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Computational Geometry and Mesh Generation #Polynomial and algebraic computation #Polytope #Polytope model #Subdivision #Triangulation #Upper and lower bounds #math.CO #math.MG #msc:52B11 #msc:52B35
paper · pdf · doi:10.1007/s00454-009-9217-8
published as Discrete & Computational Geometry, 44 (2010), no.1, 149-166 · 15 pages, 7 figures; v2: major revision: corrections of some minor errors and some additions
arxiv created 2009/07/13 · openalex publication_date 2009/08/18 · arxiv updated 2014/12/23 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05
A split of a polytope is a (necessarily regular) subdivision with exactly two maximal cells. A polytope is totally splittable if each triangulation (without additional vertices) is a common refinement of splits. This paper establishes a complete classification of the totally splittable polytopes.