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

Abstract

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

Journal of information processing   [Journal Detail]

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

Information Processing Society of Japan (IPSJ)

Cited by:  2

You must have a user ID to see the cited references.If you already have a user ID, please click "Login" to access the info.New users can click "Sign Up" to register for an user ID.

Preview

Preview

Codes

  • NII Article ID (NAID):
    110002673538
  • NII NACSIS-CAT ID (NCID):
    AA00700121
  • Text Lang:
    ENG
  • Article Type:
    Journal Article
  • ISSN:
    03876101
  • Databases:
    CJP引用  NII-ELS 

Export