S. S. Bridgeman, J. Fanto, A. Garg, R. Tamassia, and L. Vismara, InteractiveGiotto: An algorithm for interactive orthogonal graph drawing. In  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of the vertices cannot be changed after the initial placement. Four di#erent scenarios for interactive orthogonal graph drawings are studied in [29] Each scenario defines the changes allowed in the common part of two consecutive drawings. An interactive version of Giotto [33] is described in [8]; it allows the user to incrementally add vertices and edges to an orthogonal drawing in such a way that the shape of the common part of two consecutive drawings is preserved and the number of bends is minimized under this constraint. A dynamic algorithm for orthogonal drawings that allows us to ....

S. S. Bridgeman, J. Fanto, A. Garg, R. Tamassia, and L. Vismara. InteractiveGiotto: An algorithm for interactive orthogonal graph drawing. In G. Di Battista, editor, Graph Drawing (Proc. GD '97), volume 1353 of Lecture Notes Comput. Sci., pages 303--308. Springer-Verlag, 1998.

....over time. Dynamic graphs can be visualized, e.g. in an animation or in a sequence of drawings, but it is important to keep changes between consecutive frames to a minimum in order not to destroy a viewer s mental map of the graph [10] Methods for dynamic orthogonal layout are proposed in [19, 5, 3, 7]. The core modeling task of dynamic layout, i.e. the combination of criteria for good (static) layout with the requirement of small change, is therefore very similar to that of sketch driven layout. For layout algorithms based on the op timization of an objective function, the Bayesian framework ....

S. Bridgeman, J. Fanto, A. Garg, R. Tamassia, and L. Vismara. INTERACTIVEGIOTTO: An algorithm for interactive orthogonal graph drawing. Proc. Graph Drawing '97. Springer LNCS 1353:303 308, 1997.

....two types of refinement: interactive and static. During the interactive refinement of drawings we must maintain the user s mental map [20] and are allowed to make only minimal changes. The requirements for the refinement methodology are very similar to those of interactive graph drawing algorithms [3, 5, 13, 20, 19, 24]. The fact that the user has already seen a drawing of a graph means that the refinement technique must not make changes so drastic that pieces of the drawing are not recognizable. Static refinement fine tunes drawings for which we do not have to maintain the user s mental map: we are free to make ....

S. Bridgeman, J. Fanto, A. Garg, R. Tamassia and L. Vismara, Interactive Giotto: An Algorithm for Interactive Orthogonal Graph Drawing, Proc. GD '97, LNCS 1353, Springer-Verlag, 1997, pp. 303-308.

....of refinement: interactive and static. During the interactive refinement of drawings we must maintain the user s mental map [22] and are allowed to make only minimal changes. The requirements for this kind of refinement methodology are very similar to those of interactive graph drawing algorithms [3, 5, 14, 21, 22, 24, 26]. The fact that the user has already seen a drawing of a graph means that the refinement techniques must not make changes so drastic that pieces of the drawing are not recognizable. Static refinement fine tunes drawings for which we do not have to maintain the user s mental map: we are free to ....

S. Bridgeman, J. Fanto, A. Garg, R. Tamassia and L. Vismara, Interactive Giotto: An Algorithm for Interactive Orthogonal Graph Drawing, Proc. GD '97, LNCS 1353, Springer-Verlag, 1997, pp. 303-308.

....solutions can be provided. This phase, which is originally based on a mincost ow approach, is primarily responsible for the success of the method; in experiments it clearly outperformed all other methods considered [8] Several groups have tried to incorporate constraints into these methods [3, 4] but with limited success. They considered dynamic versions of the problem, where the user can insert (delete) edges and vertices and restrict the number of bends on each edge. This naturally follows from the mincost ow formulation in phase 2. The original version of GIOTTO could only draw ....

Bridgeman S., J. Fanto, A. Garg, R. Tamassia, L. Vismara, InteractiveGiotto: An Algorithm for Interactive Orthogonal Graph Drawing, Proceedings on GD'97, Rome, LNCS 1353, 303-308, 1997.

....one at a time, and the more general case of interactive graph drawing, where any combination of vertex edge deletion and insertion is allowed at each step, have been starting to receive more attention. See, for example, the work of Biedl and Kaufmann [3] Brandes and Wagner [4] Bridgeman et al. [6], Cohen et al. 8] F6Bmeier [12] Miriyala, Hornick, and Tamassia [18] Moen [20] North [21] Papakostas, Six, and Tollis [22] Papakostas and Tollis [23] and Ryall, Marks, and Shieber [26] However, while the algorithms themselves have been motivated by the need to preserve the user s mental ....

....of how the look of the drawing changes. Studying difference metrics to measure how much a drawing algorithm changes the user s mental map has a number of benefits, including providing a basis for studying the behavior of constraint based interactive drawing algorithms like InteractiveGiotto [6], where meaningful bounds on the movement of any given part of the drawing are difficult to obtain, providing a technique to compare the results of different interactive drawing algorithms, and providing a goal for the design of new drawing algorithms by identifying which qualities of the ....

[Article contains additional citation context not shown here]

S. S. Bridgeman, J. Fanto, A. Garg, R. Tamassia, and L. Vismara. InteractiveGiotto: An algorithm for interactive orthogonal graph drawing. In G. Di Battista, editor, Graph Drawing (Proc. CD '97), volume 1353 of Lecture Notes Cornput. Sci., pages 303 308. Springer-Verlag, 1997.

....in a drawing when a small change is made in the displayed graph is also called preserving the user s mental map [4] of the displayed graph) Hence, it is important to devise techniques especially suited for interactive settings. In this paper, we survey some of the techniques, such as those of [6, 5, 4, 4, 1, 3, 2, 8, 7], developed for interactive graph drawing. Notice that the term interactive graph drawing has a broad meaning, covering several aspects of graph visualization, including geometric positioning of graph objects, animation, and support for user interaction. In this paper, we focus only on the ....

S. Bridgeman, J. Fanto, A. Garg, R. Tamassia, and L. Vismara. Interactivegiotto: An algorithm for interactive orthogonal graph drawing. In G. Di Battista, editor, Graph Drawing (Proc. GD '97), volume 1353 of Lecture Notes Comput. Sci., pages 303--308. Springer-Verlag, 1997.

No context found.

S. S. Bridgeman, J. Fanto, A. Garg, R. Tamassia, and L. Vismara, InteractiveGiotto: An algorithm for interactive orthogonal graph drawing. In

No context found.

S. S. Bridgeman, J. Fanto, A. Garg, R. Tamassia, and L. Vismara, InteractiveGiotto: An algorithm for interactive orthogonal graph drawing. In [69], pp. 303-308.

No context found.

S. S. Bridgeman, J. Fanto, A. Garg, R. Tamassia, and L. Vismara, InteractiveGiotto: An algorithm for interactive orthogonal graph drawing. In [69], pp. 303-308.

No context found.

Stina S. Bridgeman, Jody Fanto, Ashim Garg, Roberto Tamassia, and Luca Vismara. InteractiveGiotto: An algorithm for interactive orthogonal graph drawing. In Proc. Graph Drawing '97, pages 303-308. Springer, LNCS vol. 1353, 1997.

No context found.

S. S. Bridgeman, J. Fanto, A. Garg, R. Tamassia, and L. Vismara, InteractiveGiotto: An algorithm for interactive orthogonal graph drawing. In

No context found.

Stina S. Bridgeman, Jody Fanto, Ashim Garg, Roberto Tamassia, and Luca Vismara. InteractiveGiotto: An algorithm for interactive orthogonal graph drawing. In Proceedings of Graph Drawing '97, pages 303--308. Springer Lecture Notes in Computer Science, vol. 1353, 1997.

No context found.

Stina S. Bridgeman, Jody Fanto, Ashim Garg, Roberto Tamassia, and Luca Vismara. InteractiveGiotto: An algorithm for interactive orthogonal graph drawing. In Proceedings of Graph Drawing '97, pages 303--308. Springer Lecture Notes in Computer Science, vol. 1353, 1997.

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