Hello in case of a nondegeneracy case of the Facet Enumeration Problem, there is a polynomial algorithm for the convex hull problem as written here https://www.inf.ethz.ch/personal/fukudak/polyfaq/node18.html . So the number of facets needs to be bounded by polynominal, so what is maximal number of facets in the nondegeneracy case?
$\begingroup$
$\endgroup$
1
-
$\begingroup$ See for instance en.wikipedia.org/wiki/Upper_bound_theorem and graphics.stanford.edu/courses/cs268-11-spring/notes/…. $\endgroup$– Richard StanleyCommented Oct 27, 2016 at 13:24
Add a comment
|