Extremal properties for dissections of convex 3-polytopes
Skip to main content
Open Access Publications from the University of California

Department of Mathematics

Faculty bannerUC Davis

Extremal properties for dissections of convex 3-polytopes

Published Web Location

No data is associated with this publication.

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 specific non-simplicial polytopes: prisms, antiprisms, Archimedean solids, and combinatorial d-cubes.

Item not freely available? Link broken?
Report a problem accessing this item