Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra

DOI10.1007/S00453-011-9570-XzbMath1235.05097OpenAlexW2082751635MaRDI QIDQ652524

Seok-Hee Hong, Hiroshi Nagamochi

Publication date: 14 December 2011

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-011-9570-x

zbMATH Keywords

polytopespolyhedraplanar graphsgraph drawingconvex polytopesconvex drawingSteinitz's theorempolyhedral graphsbiconnected graphsnon-convex polytopesspherical polyhedratriconnected graphsupward star-shaped polyhedra

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Polytopes and polyhedra (52B99) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

3D geo-graphs: efficient flip verification for the spherical zoning problem ⋮ On the construction of planar embedding for a class of orthogonal polyhedra

Cites Work

• A polynomial time circle packing algorithm
• Graphs of polyhedra; polyhedra as graphs
• Convex drawings of graphs with non-convex boundary constraints
• Convex drawings of hierarchical planar graphs and clustered planar graphs
• An algorithm for constructing star-shaped drawings of plane graphs
• Puzzles and polytope isomorphisms
• A simple way to tell a simple polytope from its graph
• Rigidity and energy
• A paradigm for robust geometric algorithms
• Characteristic numbers of 3-manifolds
• On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees
• On the \(k\)-systems of a simple polytope
• On-line maintenance of triconnected components with SPQR-trees
• Preassigning the shape of a face
• Realization spaces of polytopes
• Convex Representations of Graphs
• Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints
• Embedding 3-polytopes on a small grid
• Non-convex Representations of Graphs
• Upward Star-Shaped Polyhedral Graphs
• On the delta-wye reduction for planar graphs
• Lectures on Polytopes
• Abstract Regular Polytopes
• On-Line Planarity Testing
• Dividing a Graph into Triconnected Components
• CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS
• Cell Complexes, Valuations, and the Euler Relation
• Polytopes, graphs, and complexes
• ON CONVEX POLYHEDRA IN LOBAČEVSKIĬ SPACES
• Graph Drawing
• How to Draw a Graph
• Drawing 3-Polytopes with Good Vertex Resolution
• A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra