Abstract
We show that one can compute the combinatorial facets of a simple polytope from its graph in polynomial time. Our proof relies on a primal-dual characterization (by Joswig, Kaibel, and Körner in Israel J. Math. 129:109–118, 2002) and a linear program, with an exponential number of constraints, which can be used to construct the solution and can be solved in polynomial time. We show that this allows one to characterize the face lattice of the polytope, via a simple face recognition algorithm. In addition, we use this linear program to construct several interesting polynomial-time computable sets of graphs which may be of independent interest.
Article PDF
Similar content being viewed by others
References
Bertsekas, D.P.: Dynamic Programming and Optimal Control. Scientific, Athena (1995)
Blind, R., Mani-Levitska, P.: On puzzles and polytope isomorphisms. Aeq. Math. 34, 287–297 (1987)
Joswig, M., Kaibel, V., Körner, F.: On the k-systems of a simple polytope. Israel J. Math. 129, 109–118 (2002)
Kaibel, V.: Reconstructing a simple polytope from its graph. In: Jünger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization—Eureka, You Shrink! pp. 105–118. Springer, New York (2002)
Kaibel, V., Pfetsch, M.: Computing the face lattice of a polytope from its vertex–facet incidences. Comput. Geom. 23, 281–290 (2002)
Kalai, G.: A simple way to tell a simple polytope from its graph. J. Comb. Theory, Ser. A 49, 381–383 (1988)
Mnev, N.E.: The universality theorems on the classification problem of configuration varieties and convex polytopes varieties. In: Topology and Geometry—Rohlin Seminar, vol. 1346, pp. 527–543. Springer, Berlin/New York (1988)
Richter-Gebert, J., Ziegler, G.M.: Realization spaces of 4-polytopes are universal. Bull. Am. Math. Soc. 32(4), 403–412 (1995)
Schrijver, A.: Theory of Linear and Integer Programming. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, Chichester (2000)
Szabó, T., Welzl, E.: Unique sink orientations of cubes. In: Proc. 42nd Ann. IEEE Symp. on Foundations of Computer Science (FOCS), pp. 547–555. New York (2001)
Ziegler, G.M.: Lectures on Polytopes. Springer, New York (1998)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Günter M. Ziegler.
Rights and permissions
About this article
Cite this article
Friedman, E.J. Finding a Simple Polytope from Its Graph in Polynomial Time. Discrete Comput Geom 41, 249–256 (2009). https://doi.org/10.1007/s00454-008-9121-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-008-9121-7