Small sets supporting fary embeddings of planar graphs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Embedding planar graphs on the grid
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Characterizing bar line-of-sight graphs
SCG '85 Proceedings of the first annual symposium on Computational geometry
Drawing High Degree Graphs with Low Bend Numbers
GD '95 Proceedings of the Symposium on Graph Drawing
2-Visibility Drawings of Planar Graphs
GD '96 Proceedings of the Symposium on Graph Drawing
The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Straight Line Embeddings of Planar Graphs on Point Sets
Proceedings of the 8th Canadian Conference on Computational Geometry
Computational Aspects of VLSI
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Generating Outerplanar Graphs Uniformly at Random
Combinatorics, Probability and Computing
Area-efficient planar straight-line drawings of outerplanar graphs
Discrete Applied Mathematics
A Lower Bound on the Area Requirements of Series-Parallel Graphs
Graph-Theoretic Concepts in Computer Science
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Small area drawings of outerplanar graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
Small drawings of series-parallel graphs and other subclasses of planar graphs
GD'09 Proceedings of the 17th international conference on Graph Drawing
Small grid drawings of planar graphs with balanced bipartition
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Straight-line drawings of outerplanar graphs in O(dnlogn) area
Computational Geometry: Theory and Applications
Small grid drawings of planar graphs with balanced partition
Journal of Combinatorial Optimization
h-quasi planar drawings of bounded treewidth graphs in linear area
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
In this paper, we study drawings of outer-planar graphs in various models. We showthat O(n log n) area can be achieved for such drawings if edges are allowed to have bends or if vertices may be represented by boxes. The question of straight-line grid-drawings of outerplanar graphs in o(n2) area remains open.