Abstract
AbstractIn a grid drawing of a planar graph, every vertex is located at a grid point, and every edge is drawn as a straight-line segment without any edge-intersection. It has been known that every planar graph G of n vertices has a grid drawing on an (n − 2)×(n − 2) integer grid and such a drawing can be found in linear time. In this paper we show that if a planar graph G has a balanced bipartition then G has a grid drawing with small grid area. More precisely, if a separation pair bipartitions G into two edge-disjoint subgraphs G 1 and G 2, then G has a grid drawing on a W×H grid such that both the width W and height H are smaller than the larger number of vertices in G 1 and in G 2. In particular, we show that every series-parallel graph G has a grid drawing on a (2n/3)×(2n/3) grid and such a drawing can be found in linear time.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
