An incremental approach to aesthetic graph layout
- 30 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 297-308
- https://doi.org/10.1109/case.1993.634832
Abstract
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.Keywords
This publication has 1 reference indexed in Scilit:
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987