Abstract
We derive tight expressions for the maximum number of -faces, , of the Minkowski sum, , of three -dimensional convex polytopes , and , as a function of the number of vertices of the polytopes, for any . Expressing the Minkowski sum of the three polytopes as a section of their Cayley polytope , the problem of counting the number of -faces of , reduces to counting the number of -faces of the subset of comprising of the faces that contain at least one vertex from each . In two dimensions our expressions reduce to known results, while in three dimensions, the tightness of our bounds follows by exploiting known tight bounds for the number of faces of -polytopes, where . For , the maximum values are attained when , and are -polytopes, whose vertex sets are chosen appropriately from three distinct -dimensional moment-like curves.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.