An efficient orthogonal grid drawing algorithm for cubic graphs

In this paper we present a new algorithm that constructs an orthogonal drawing of a graph G with degree at most three. Even if we do not require any limitations neither to planar nor to biconnected graphs, we reach the best known results in the literarture: each edge has at most 1 bend, the total number of bends is less than or equal to n/2 + 1, and the area is less than or equal to (n/2-1)(2)