The lower and upper bound problems for cubical polytopes
- 64 Downloads
We construct a family of cubical polytypes which shows that the upper bound on the number of facets of a cubical polytope (given a fixed number of vertices) is higher than previously suspected. We also formulate a lower bound conjecture for cubical polytopes.
KeywordsConvex Hull Discrete Comput Geom Boundary Complex Modeling Clay Simplicial Polytopes
- [R]Rutgers University, Problems presented at the DIMACS Workshop on Polytopes and Convex Sets, 1990.Google Scholar