Drawing K2,n: a lower bound

Authors:
Therese Biedl;Timothy M. Chan;Alejandro López-Ortiz
Affiliations:
School of Computer Science, University of Waterloo, Waterloo, Ontario, N2L 3G1 Canada;School of Computer Science, University of Waterloo, Waterloo, Ontario, N2L 3G1 Canada;School of Computer Science, University of Waterloo, Waterloo, Ontario, N2L 3G1 Canada
Venue:
Information Processing Letters
Year:
2003

Citing 2
Cited 2

Graph Drawing: Algorithms for the Visualization of Graphs

Graph Drawing: Algorithms for the Visualization of Graphs
Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions

GD '01 Revised Papers from the 9th International Symposium on Graph Drawing

A Lower Bound on the Area Requirements of Series-Parallel Graphs

Graph-Theoretic Concepts in Computer Science
Improved lower bounds on the area requirements of series-parallel graphs

GD'10 Proceedings of the 18th international conference on Graph drawing

Quantified Score

Hi-index	0.89

Visualization

Abstract

We give a tradeoff theorem between the area and the aspect ratio required by any planar straight-line drawing of K2,n on the integer lattice. In particular we show that if the drawing is contained in a rectangle of area O(n) then the rectangle must have aspect ratio Ω (n), and conversely, if the aspect ratio is O(1) then the area must be Ω (n2/log2/n).