An incremental approach to aesthetic graph layout
Miriyala, K.; Hornick, S.W.; Tamassia, R.
Computer-Aided Software Engineering, 1993. CASE apos;93., Proceeding of the Sixth International Workshop on
Volume , Issue , 19-23 Jul 1993 Page(s):297 - 308
Digital Object Identifier   10.1109/CASE.1993.634832
Summary:In CASE tools, software representations-dataflow diagrams and entity-relationship diagrams, for example-change or are changed interactively during software evolution. The displays of these representations should only change minimally so that the user can follow and validate the process. This can be achieved by having a layout approach that respects the current node positioning and draws new edges without disturbing any of the existing nodes or edges. New nodes may not overlap existing nodes and only cause any overlapped edges to be redrawn. This incremental graph layout problem is addressed here. A practical algorithm and its implementation, which efficiently routes edges according to the criteria of no node overlap and (heuristically) minimum crossings, bends, and length of edges, are discussed

» View citation and abstract

Log in by entering your IEEE Web Account Username and Password.

IEEE Communications Society members: If you subscribe to the IEEE Electronic Periodicals Package or IEEE Electronic Periodicals Package Plus, you must access your subscription at www.comsoc.org.

Check with your librarian, information professional, or system manager to determine if you need to log in. Please complete the online Technical Support Form if you need assistance.

Select the Purchase History link to access the document. You will have 5 Days after purchase to access the Full Text PDF. Please complete the online Technical Support Form if you need assistance.

• Search and access Abstract records free of charge
• Register for table of contents alerts
• Purchase Full Text PDF documents

» Learn more about subscription options or how to become an IEEE Member.