Drawing graphs in the plane with a prescribed outer face and polynomial area

Authors:
Erin W. Chambers;David Eppstein;Michael T. Goodrich;Maarten Löffler
Affiliations:
Dept. of Math and Computer Science, Saint Louis Univ.;Computer Science Dept., University of California, Irvine;Computer Science Dept., University of California, Irvine;Computer Science Dept., University of California, Irvine
Venue:
GD'10 Proceedings of the 18th international conference on Graph drawing
Year:
2010

Citing 10
Cited 0

On the optimal layout of planar graphs with fixed boundary

SIAM Journal on Computing
Graph drawing by force-directed placement

Software—Practice & Experience
A linear-time algorithm for drawing a planar graph on a grid

Information Processing Letters
Drawing graphs nicely using simulated annealing

ACM Transactions on Graphics (TOG)
Convex drawings of graphs in two and three dimensions (preliminary version)

Proceedings of the twelfth annual symposium on Computational geometry
Embedding planar graphs on the grid

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Computing a canonical polygonal schema of an orientable triangulated surface

SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
A multi-dimensional approach to force-directed layouts of large graphs

Computational Geometry: Theory and Applications - Special issue on the 10th fall workshop on computational geometry
Greedy Drawings of Triangulations

Discrete & Computational Geometry
Planar drawings of higher-genus graphs

GD'09 Proceedings of the 17th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the classic graph drawing problem of drawing a planar graph using straight-line edges with a prescribed convex polygon as the outer face. Unlike previous algorithms for this problem, which may produce drawings with exponential area, our method produces drawings with polynomial area. In addition, we allow for collinear points on the boundary, provided such vertices do not create overlapping edges. Thus, we solve an open problem of Duncan et al., which, when combined with their work, implies that we can produce a planar straight-line drawing of a combinatorially-embedded genus-g graph with the graph's canonical polygonal schema drawn as a convex polygonal external face.