Arboricity and subgraph listing algorithms
SIAM Journal on Computing
The complexity of minimizing wire lengths in VLSI layouts
Information Processing Letters
On embedding a graph in the grid with the minimum number of bends
SIAM Journal on Computing
The complexity of recognizing polyhedral scenes
Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
American Mathematical Monthly
On-line graph algorithms with SPQR-trees
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Planar orientations with low out-degree and compaction of adjacency matrices
Theoretical Computer Science
Sliceable Floorplanning by Graph Dualization
SIAM Journal on Discrete Mathematics
Graph-theoretical conditions for inscribability and Delaunay realizability
Discrete Mathematics
Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
Theoretical Computer Science
Embedding planar graphs on the grid
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
Tight(er) worst-case bounds on dynamic searching and priority queues
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
WG '92 Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science
Optimal three-dimensional orthogonal graph drawing in the general position model
Theoretical Computer Science
The lattice dimension of a graph
European Journal of Combinatorics
Graph drawings with few slopes
Computational Geometry: Theory and Applications
Drawings of planar graphs with few slopes and segments
Computational Geometry: Theory and Applications
Drawing cubic graphs with at most five slopes
Computational Geometry: Theory and Applications
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Schnyder Woods and Orthogonal Surfaces
Discrete & Computational Geometry
Area-universal rectangular layouts
Proceedings of the twenty-fifth annual symposium on Computational geometry
Geometric representation of cubic graphs with four directions
Computational Geometry: Theory and Applications
Transversal structures on triangulations, with application to straight-line drawing
GD'05 Proceedings of the 13th international conference on Graph Drawing
Hexagonal grid drawings: algorithms and lower bounds
GD'04 Proceedings of the 12th international conference on Graph Drawing
How to draw a Tait-colorable graph
GD'10 Proceedings of the 18th international conference on Graph drawing
Planar lombardi drawings for subcubic graphs
GD'12 Proceedings of the 20th international conference on Graph Drawing
The graphs of planar soap bubbles
Proceedings of the twenty-ninth annual symposium on Computational geometry
PolyCut: monotone graph-cuts for PolyCube base-complex construction
ACM Transactions on Graphics (TOG)
Hi-index | 0.00 |
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex. By analogy to Steinitz's theorem characterizing the graphs of convex polyhedra, we characterize the graphs of simple orthogonal polyhedra: they are exactly the 3-regular bipartite planar graphs in which the removal of any two vertices produces at most two connected components. We also characterize two subclasses of these polyhedra: corner polyhedra, which can be drawn by isometric projection in the plane with only one hidden vertex, and xyz polyhedra, in which each axis-parallel line through a vertex contains exactly one other vertex. Based on our characterizations we find efficient algorithms for constructing orthogonal polyhedra from their graphs