Box-Rectangular Drawings of Plane Graphs (Extended Abstract)

In this paper we introduce a new drawing style of a plane graph G, called a "box-rectangular drawing." It is defined to be a drawing of G on an integer grid such that every vertex is drawn as a rectangle, called a box, each edge is drawn as either a horizontal line segment or a vertical line segment, and the contour of each face is drawn as a rectangle. We establish a necessary and sufficient condition for the existence of a box-rectangular drawing of G. We also give a simple linear- time algorithm to find a box-rectangular drawing of G if it exists.