Abstract
We show that for every simplicial polytope an inscribed simplicial polytope exists that has the same dimension, number of vertices, number of edges, and number of 2-faces. This proves that the g-theorem for simplicial polytopes also holds for the class of inscribed simplicial polytopes (up to dimension 7). The proof includes an incremental construction scheme for Delaunay triangulations.
Similar content being viewed by others
References
Barnette, D.W.: The minimum number of vertices of a simple polytope. Isr. J. Math. 10, 121–125 (1971)
Barnette, D.W.: A proof of the lower bound conjecture for convex polytopes. Pac. J. Math. 46, 349–354 (1973)
Berger, M.: Geometry I, corrected edn. Springer, Berlin (2009)
Berger, M.: Geometry II, corrected edn. Springer, Berlin (2009)
Billera, L.J., Lee, C.W.: Sufficiency of McMullen’s conditions for \(f\)-vectors of simplicial polytopes. Bull. Am. Math. Soc. (N.S.) 2, 181–185 (1980)
Billera, L.J., Lee, C.W.: A proof of the sufficiency of McMullen’s conditions for \(f\)-vectors of simplicial convex polytopes. J. Comb. Theory, Ser. A 31, 237–255 (1981)
Brown, K.Q.: Voronoi diagrams from convex hulls. Inf. Process. Lett. 9, 223–228 (1979)
De Loera, J.A., Rambau, J., Santos, F.P.: Triangulations. Springer, Heidelberg (2010)
Dillencourt, M.B., Smith, W.D.: A linear-time algorithm for testing the inscribability of trivalent polyhedra. Int. J. Comput. Geom. Appl. 5, 21–36 (1995)
Dillencourt, M.B., Smith, W.D.: Graph-theoretical conditions for inscribability and Delaunay realizability. Discrete Math. 161, 63–77 (1996)
Edelsbrunner, H.: Geometry and Topology for Mesh Generation. Cambridge University Press, Cambridge (2001)
Gale, D.: Neighborly and cyclic polytopes. In: Proceedings of Symposia in Pure Mathematics, Vol. VII, pp. 225–232 (1963)
Gonska, B., Ziegler, G.M.: Inscribable stacked polytopes. Adv. Geom. 13, 723–740 (2013)
Grünbaum, B.: Convex Polytopes. Graduate Texts in Mathematics, vol. 221, 2nd edn. Springer, New York (2003)
Hodgson, C.D., Rivin, I., Smith, W.D.: A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere. Bull. Am. Math. Soc. (N.S.) 27, 246–251 (1992)
McMullen, P.: The maximum numbers of faces of a convex polytope. Mathematika 17, 179–184 (1970)
Rivin, I.: On geometry of convex ideal polyhedra in hyperbolic 3-space. Topology 32, 87–92 (1993)
Rivin, I.: A characterization of ideal polyhedra in hyperbolic 3-space. Ann. Math. 143, 51–70 (1996)
Rivin, I., Hodgson, C.D.: A characterization of compact convex polyhedra in hyperbolic 3-space/corrigendum. Invent. Math. 111/117, 77–111/359 (1993/1994)
Seidel, R.: Exact upper bounds for the number of faces in \(d\)-dimensional Voronoĭ diagrams. In: Applied Geometry and Discrete Mathematics, vol. 4 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci. American Mathematical Society, Providence, RI, pp. 517–529 (1991)
Stanley, R.P.: The number of faces of a simplicial convex polytope. Adv. Math. 35, 236–238 (1980)
Steiner, J.: Systematische Entwicklung der Abhängigkeit geometrischer Gestalten von einander, Gesammelte Werke, Reimer, Berlin (Original publication: Fincke, Berlin (1832)), vol. 1, pp. 229–458 (1881)
Steinitz, E.: Über isoperimetrische Probleme bei konvexen Polyedern. J. Reine Angew. Math. 158/159, 129–153/143 (1927/1928)
Ziegler, G.M.: Lectures on Polytopes. Graduate Texts in Mathematics, vol. 152. Springer, New York (1995)
Ziegler, G.M.: Face numbers of 4-polytopes and 3-spheres. In: Proceedings of the International Congress of Mathematicians, vol. III, pp. 625–634. Higher Ed. Press, Beijing (2002)
Author information
Authors and Affiliations
Corresponding author
Additional information
Editor in Charge: Herbert Edelsbrunner and János Pach
Rights and permissions
About this article
Cite this article
Gonska, B. About f-Vectors of Inscribed Simplicial Polytopes. Discrete Comput Geom 55, 497–521 (2016). https://doi.org/10.1007/s00454-016-9764-8
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-016-9764-8