How to Draw a Directed Graph

    • EADES PETER
    • Geometric Algorithms Laboratory, Key Centre for Software Technology, Department of Computer Science, University of Queensland
    • SUGIYAMA KOZO
    • International Institute for Advanced Study of Social Information Science, Fujitsu Limited

抄録

Several recent tools for visualizing software and information engineering problems have used directed graphs as a basic model. This has generated considerable interest in algorithms for drawing directed graphs that are easy to understand and remember. This paper discusses a practical and general method for making drawings according to specific aestbetic criteria. Some recent algorithms for drawing directed graphs are instances of this general method. The aesthetic criteria can be viewed as goals of optimization problems. Each step of the general method aims to meet one of the criteria by solving these optimization problems. We survey the current state of knowledge of each of the optimization problems and indicate unsolved problems.

収録刊行物

Journal of information processing   [収録刊行物詳細]

13(4)  pp.424-437 19910210  [目次]

社団法人情報処理学会

被引用文献:  2件

被引用文献を見るにはログインが必要です。ユーザIDをお持ちでない方は新規登録してください。

プレビュー

プレビュー

各種コード

  • NII論文ID(NAID):
    110002673538
  • NII書誌ID(NCID):
    AA00700121
  • 本文言語コード:
    ENG
  • 資料種別:
    雑誌論文
  • ISSN:
    03876101
  • 収録DB:
    CJP引用  NII-ELS 

書き出し