On the Orthogonal Drawing of Outerplanar Graphs
Kiyoshi Nomura · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 2005
In this paper we show that an outerplanar graph G with maximum degree at most 3 has a 2-D orthogonal drawing with no bends if and only if G contains no triangles. We also show that an outerplanar graph G with maximum degree at most 6 has a 3-D orthogonal drawing with no bends if and only if G contains no triangles.