| Extremal properties for dissections of convex 3-polytopes (2007) | |||||||||||||||
Abstract | |||||||||||||||
| Abstract. A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose vertices are among the vertices of the polytope. Triangulations are dissections that have the additional property that the set of all its simplices forms a simplicial complex. The size of a dissection is the number of d-simplices it contains. This paper compares triangulations of maximal size with dissections of maximal size. We also exhibit lower and upper bounds for the size of dissections of a 3-polytope and analyze extremal size triangulations for specic non-simplicial polytopes: prisms, antiprisms, Archimedean solids, and combinatorial d-cubes. Key words. dissection; triangulation; mismatched region; lattice polytope; combinatorial d-cube; prism; antiprism; Archimedean solid | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||