This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A layout algorithm for data flow diagrams
April 1986 (vol. 12 no. 4)
pp. 538-546
A layout algorithm is presented that allows the automatic drawing of data flow diagrams, a diagrammatic representation widely used in the functional analysis of information systems. A grid standard is defined for such diagrams, and aesthetics for a good readability are identified. The layout algorithm receives as input an abstract graph, specifying connectivity relations between the elements of the diagram, and produces as output a corresponding diagram according to the aesthetics. The basic strategy is to build incrementally the layout; first, a good topology is constructed with few crossings between edges; subsequently, the shape of the diagram is determined in terms of angles appearing along edges; and finally, dimensions are given to the graph, obtaining a grid skeleton for the diagram.
Index Terms:
Layout,Standards,Algorithm design and analysis,Shape,Planarization,Skeleton,Minimization,layout algorithms,Database design,design tools,functional analysis
Citation:
"A layout algorithm for data flow diagrams," IEEE Transactions on Software Engineering, vol. 12, no. 4, pp. 538-546, April 1986, doi:10.1109/TSE.1986.6312901
Usage of this product signifies your acceptance of the Terms of Use.