Extremal properties for dissections of convex 3-polytopes

Details Extremal properties for dissections of convex 3-polytopes Extremal properties for dissections of convex 3-polytopes

2000-12-18

arxiv.org/abs/math/0012169v1

Mathematics

Combinatorics

19 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Extremal properties for dissections of convex 3-polytopes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Extremal properties for dissections of convex 3-polytopes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Extremal properties for dissections of convex 3-polytopes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-256460