Steinitz Theorems for Orthogonal Polyhedra

DOI10.20382/jocg.v5i1a10zbMath1408.52016arXiv0912.0537OpenAlexW4298005903MaRDI QIDQ2968117

David Eppstein, Elena Mumford

Publication date: 9 March 2017

Published in: Proceedings of the twenty-sixth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0912.0537

zbMATH Keywords

planar graphSteinitz theoremSteinitz's theoremorthogonal polyhedronbipartite cubic polyhedral graphssimple orthogonal polyhedra

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (10)

Intrinsic mixed-integer polycubes for hexahedral meshing ⋮ On polyhedral graphs and their complements ⋮ Enumeration of corner polyhedra and 3-connected Schnyder labelings ⋮ Enumerative combinatorics. Abstracts from the workshop held December 11--17, 2022 ⋮ Enumeration of corner polyhedra and 3-connected Schnyder labelings ⋮ On the construction of planar embedding for a class of orthogonal polyhedra ⋮ Generating 4-connected even triangulations on the sphere ⋮ A Möbius-invariant power diagram and its applications to soap bubbles and planar Lombardi drawing ⋮ Realization and connectivity of the graphs of origami flat foldings ⋮ Unnamed Item

This page was built for publication: Steinitz Theorems for Orthogonal Polyhedra