Results 1 
2 of
2
Efficient Algorithms for Drawing Planar Graphs
, 1999
"... x 1 Introduction 1 1.1 Historical Background . . .............................. 4 1.2 Drawing Styles . ................................... 4 1.2.1 Polyline drawings .............................. 5 1.2.2 Planar drawings ............................... 5 1.2.3 Straight line drawings ................. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
x 1 Introduction 1 1.1 Historical Background . . .............................. 4 1.2 Drawing Styles . ................................... 4 1.2.1 Polyline drawings .............................. 5 1.2.2 Planar drawings ............................... 5 1.2.3 Straight line drawings ............................ 6 1.2.4 Orthogonal drawings . . ........................... 7 1.2.5 Grid drawings ................................ 8 1.3 Properties of Drawings ................................ 9 1.4 Scope of this Thesis .................................. 10 1.4.1 Rectangular drawings . . . ......................... 11 1.4.2 Orthogonal drawings . . ........................... 12 1.4.3 Boxrectangular drawings ........................... 14 1.4.4 Convex drawings . . ............................. 16 1.5 Summary ....................................... 16 2 Preliminaries 20 2.1 Basic Terminology .................................. 20 2.1.1 Graphs and Multigraphs ........................... 20 i CO...
On a Class of Planar Graphs with . . .
, 2009
"... A straightline grid drawing of a planar graph G is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straightline segment without edge crossings. It is well known that a planar graph of n vertices admits a straightline grid drawing on a g ..."
Abstract
 Add to MetaCart
A straightline grid drawing of a planar graph G is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straightline segment without edge crossings. It is well known that a planar graph of n vertices admits a straightline grid drawing on a grid of area O(n 2). A lower bound of Ω(n 2) on the arearequirement for straightline grid drawings of certain planar graphs are also known. In this paper, we introduce a fairly large class of planar graphs which admits a straightline grid drawing on a grid of area O(n). We give a lineartime algorithm to find such a drawing. Our new class of planar graphs, which we call “doughnut graphs, ” is a subclass of 5connected planar graphs. We show several interesting properties of “doughnut graphs” in this paper. One can easily observe that any spanning subgraph of a “doughnut graph” also admits a straightline grid drawing with linear area. But the recognition of a spanning subgraph of a “doughnut graph” seems to be a nontrivial problem, since the recognition of a spanning subgraph of a given graph is an NPcomplete problem in general. We establish a necessary and sufficient condition for a 4connected planar graph G to be a spanning subgraph of a “doughnut graph.” We also give a lineartime algorithm to augment a 4connected planar graph G to a “doughnut graph” if G satisfies the necessary and sufficient condition.