We introduce a new wider class of polyhedra called upward (star-shaped) polyhedra, and present a graph-theoretic characterization. Our proof includes a drawing algorithm which constructs an upward polyhedron with n vertices in O(n 1.5) time. Moreover, we can test whether a given plane graph is an upward polyhedral graph in linear time. Our result is the first graph-theoretic characterization of non-convex polyhedra, which solves an open problem posed by Grünbaum [6], and a generalization of the Steinitz' theorem [9]. © 2009 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Hong, S. H., & Nagamochi, H. (2009). Upward star-shaped polyhedral graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5878 LNCS, pp. 913–922). https://doi.org/10.1007/978-3-642-10631-6_92
Mendeley helps you to discover research relevant for your work.