A plane graph is a planar graph with a fixed embedding. In a rectangular drawing of a plane graph, each vertex is drawn as
a point, each edge is drawn as a horizontal or vertical line segment, and each face is drawn as a rectangle. A planar graph
is said to have a rectangular drawing if at least one of its plane embeddings has a rectangular drawing. In this paper we
give a linear-time algorithm to examine whether a planar graph G of the maximum degree three has a rectangular drawing or not, and to find a rectangular drawing of G if it exists.
This work is supported by JSPS grants.