Publication IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer SciencesVol.E88-ANo.6pp.1583-1588 Publication Date: 2005/06/01 Online ISSN: DOI: 10.1093/ietfec/e88-a.6.1583 Print ISSN: 0916-8508 Type of Manuscript: PAPER Category: Graphs and Networks Keyword: orthogonal drawing, bend, outerplanar graph,
Full Text: PDF(213.1KB)>>
Summary: 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.