On the Orthogonal Drawing of Outerplanar Graphs

  • Authors:

  • Kumiko Nomura;Satoshi Tayu;Shuichi Ueno

  • Affiliations:

  • The authors are with the Graduate School of Science and Engineering, Tokyo Institute of Technology, Tokyo, 152-8552 Japan. E-mail: nomura@lab.ss.titech.ac.jp;The authors are with the Graduate School of Science and Engineering, Tokyo Institute of Technology, Tokyo, 152-8552 Japan. E-mail: nomura@lab.ss.titech.ac.jp;The authors are with the Graduate School of Science and Engineering, Tokyo Institute of Technology, Tokyo, 152-8552 Japan. E-mail: nomura@lab.ss.titech.ac.jp

  • Venue:
  • IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.