C. Batini, E. Nardelli, and R. Tamassia. A layout algorithm for data-flow diagrams. IEEE Trans. Soft. Eng., SE-12(4):538--546, 1986.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the upward planarization is generated and the dummy nodes are discarded. A similar strategy has been applied very successfully in the area of drawing undirected graphs. The most popular algorithms based on this strategy are perhaps the graph drawing algorithms descending from the GIOTTO approach [2][20] for orthogonal drawings. In [8] we showed recently how to extend the GIOTTO approach to mixed upward planar drawings of mixed upward planar graphs, i.e. mixed graphs which have a planar drawing in which the directed part of the graph is drawn upward. The above strategy can also be applied to ....

C. Batini, E. Nardelli, and R. Tamassia, A Layout Algorithm for Data-Flow Diagrams, IEEE Trans. Softw. Eng., SE-12(4), 1986, pp. 538-546

....in Fig. 1. a) b) c) Figure 1: Orthogonal drawings of K 5 : a) 1 bend 2 D square drawing, b) 2 bend 3 D pointdrawing, c) 0 bend 3 D line drawing. Applications of 2 D and 3 D orthogonal drawings include VLSI circuit design [Len90, CM98, Pre83, Ros83, SLM 84] and software engineering [TT84, BNT86, TDB88, WHF93] Orthogonal point drawings have been studied extensively in two dimensions (see [DETT94, DETT99] for surveys) and to a lesser extent in three and more dimensions [BSWW98, Bie95, CGJW, ESW96, ESW97, ESW98, HEQL98, KB67, PT98, Woo97, Woo98] However, D dimensional point drawings can ....

C. Batini, E. Nardelli, and R. Tamassia. A layout algorithm for data-flow diagrams. IEEE Trans. on Software Engineering, SE-12(4):538--546, 1986.

....from that. In this environment, we design and test a data flow graph grammar without writing a single line of code, just by drawing it on screen. Our concept can be used for many other structures, e.g. for the visualization of flowcharts or data structures. Alternatively, Batini et al. [1] propose a layout algorithm for planar data flow graphs that is based on conventional graph drawing algorithms. Their approach does not respect any structural information. 2 Data flow graphs A data flow graph is a directed graph D = V; E) where V is a finite set of actors and E = f(u; v) j u; ....

C. Batini, E. Nardelli, and R. Tamassia, A Layout Algorithm for Data-Flow Diagrams. IEEE Transactions on Software Engineering, vol. SE-12, no. 4, pp. 538-546, 1986.

....drawing. There are many other requirements, which might be even contradicting. Orthogonal drawings of planar graphs have been extensively studied in the last decade. There are plenty of applications like VLSI design [10] entity relationship and data flow diagrams in Software Engineering (e.g. [6, 12, 2, 14, 1]) or visualization of interactions inside of molecular structures in Astrophysics [3] In some of them multiple edges are necessary, so we have to handle multigraphs. Many results and algorithms have been worked out [5] one of the most important is Tamassia s algorithm from [16] How to draw a ....

Batini, C., E. Nardelli, and R. Tamassia, A Layout Algorithm for Data-Flow Diagrams, IEEE Trans. on Software Engineering, Vol. SE-12 (4), pp. 538-546, 1986.

.... have noted that edge crossings in a layout can impede its readability [Sug87, BNTT84] Many graph layout systems have adopted a planarization approach, that is, producing a layout by planarizing the graph first and then applying a planar graph layout algorithm [TBB88, Tam85, BPTT89, BTT84, BNT86, BNTT85, BFN85] In 1930, Kuratowski [Kur30] gave his famous characterization of planar graphs in terms of forbidden subgraphs. However, Kuratowski s characterization does not immediately lead to an efficient planarity testing algorithm. The first and the best known planarity testing algorithm ....

C. Batini, E. Nardelli, and R. Tamassia. A layout algorithm for data-flow diagrams. IEEE Transactions on Software Engineering, SE12 (4):538--546, 1986.

.... This is due in part to the inability to specify the aesthetic criteria individuals use in understanding graphs[22] Nonetheless, for certain restricted classes of graphs in which graph theoretic expressions of aesthetic criteria can be specified, satisfactory algorithms have been developed[8, 46, 58]. Some of the aesthetics for drawings of general undirected graphs are symmetry, minimization of edge crossings and bends in edges, uniform edge lengths, and uniform node distribution. These aesthetics are such that optimality of one may prevent optimality in others. Additionally, graph layout ....

Batini, C., Nardelli, E., and Tamassia, R. (1986.) "A layout algorithm for data-flow diagrams". IEEE Transactions on Software Engineering, 12(4), 538-546.

....Science, 4107 Upson Hall, Cornell University, Ithaca, NY 14853, karl cs.cornell.edu 1 INTRODUCTION Graphs, consisting of a set of nodes and a set of edges, are one of the most fundamental ways of representing relationships among objects. Programs that display a set of relationships as a graph [12, 11, 14, 2, 4] have become more prevalent in recent years because of two major factors. Firstly, a person is usually able to comprehend information better when it is presented pictorially (for example a graph) rather than in textual form. This is partly due to the fact that structural properties such as ....

C. Batini, E. Nardelli, and R. Tamassia. A layout algorithm for data flow diagrams. IEEE Transactions on Software Engineering, SE-12(4):538-- 546, April 1986.

No context found.

C. Batini, E. Nardelli, and R. Tamassia. A layout algorithm for data-flow diagrams. IEEE Trans. Softw. Eng., SE-12(4):538--546, 1986.

No context found.

C. Batini, E. Nardelli, and R. Tamassia. A layout algorithm for data-flow diagrams. IEEE Trans. Soft. Eng., SE-12(4):538--546, 1986.

No context found.

C. Batini, E Nardelli, and R. Tamassia. A layout algorithm for data-flow diagrams. IEEE Trans. Softw. Eng., SE-12(4):538--546, 1986.

No context found.

C. Batini, E. Nardelli, and R. Tamassia. A layout algorithm for data-flow diagrams. IEEE Trans. Softw. Eng., SE-12(4):538--546, 1986.

No context found.

C.Batini, E.Nardelli, R.Tamassia, "A layout algorithm for data-flow diagrams", IEEE Trans. Softw. Eng. SE-12, 4, 538-546, 1986.

No context found.

C. Batini, E. Nardelli, and R. Tamassia. A layout algorithm for data flow diagrams. IEEE Trans. on Software Engineering, 12(4):538--546, Apr. 1986.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC