Algorithms for Drawing Plane Graphs

• NISHIZEKI Takao

  Graduate School of Information Sciences, Tohoku University

• MIURA Kazuyuki

  Graduate School of Information Sciences, Tohoku University

• RAHMAN Md. Saidur

  Graduate School of Information Sciences, Tohoku University

抄録

Graph drawing addresses the problem of constructing geometric representation of information and finds applications in almost every branch of science and technology. Efficient algorithms are essential for automatic drawings of graphs, and hence a lot of research has been carried out in the last decade by many researchers over the world to develop efficient algorithms for drawing graphs. In this paper we survey the recent algorithmic results on various drawings of plane graphs: straight line drawing, convex drawing, orthogonal drawing, rectangular drawing and box-rectangular drawing.

収録刊行物

• IEICE transactions on information and systems

  IEICE transactions on information and systems 87 (2), 281-289, 2004-02-01

  一般社団法人電子情報通信学会

キーワード

• straight line drawing
• convex drawing
• grid drawing
• rectangular drawing
• box-rectangular drawing
• orthogonal drawing
• plane graph

詳細情報

• CRID: 1572261552224599808
• NII論文ID: 110003223347
• NII書誌ID: AA10826272
• ISSN: 09168532
• 本文言語コード: en
• データソース種別:
  • CiNii Articles