U. Brandes and D. Wagner, Dynamic grid embedding with few bends and changes. In [57], pp. 89-98.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....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 specify the relative importance of the number of bends vs. the number of changes between two consecutive drawings is given in [6]. Other algorithms for constructing drawings of graphs incrementally, while preserving the mental map of the user, are for example [26, 11, 28] Also, a study on di#erent metrics that can be used to evaluate the changes between drawings in an interactive scenario is presented in [7] However, as ....

U. Brandes and D. Wagner. Dynamic grid embedding with few bends and changes. In K.-Y. Chwa and O. H. Ibarra, editors, ISAAC'98, volume 1533 of Lecture Notes Comput. Sci., pages 89--98. Springer-Verlag, 1998.

....is given by Marzal and Vidal [17] The value of the shape metric is the average edit distance over the graph s edges. shape(D, D ) E[ l i[E[ edits(e , eti) Shape is scale and translation independent. The shape metric is similar in spirit to the cost function used by Brandes and Wagner [5] in their dynamic extension of Giotto [27] Their cost function counts the number of changes in angles at vertices and edge bends; the shape metric takes this in account to some degree by noting changes in the direction of an edge segment. a) b) Figure 5: Shape: a) and (b) look different even ....

U. Brandes and D. Wagner. Dynamic grid embedding with few bends and changes. In Proceedings of the 9th Annual International Symposium on Algorithms and Computation (ISAAC'98), volume 1533 of Lecture Notes in Com- puter Science, pages 89 98. 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 ....

....between static layout criteria and stability. Since orthogonal drawing algorithms in the topology shape metrics framework heavily depend on the angles and bends computed in the shape step, it seems natural to use the change in angles and bends as a difference metric for orthogonal shapes [3, 1]. 3 The Algorithm Throughout this section, let be an admissible drawing (a sketch) of a graph G (V, E) where a sketch is admissible if there is no overlap between edges and non incident vertices, and no more than two edges cross in single point. Any sketch can be transformed into an admissible ....

U. Brandes and D. Wagner. Dynamic grid embedding with few bends and changes. Proc. Algorithms and Computation '98. Springer LNCS 1533:89 98, 1998.

....the main challenge for dynamic graph layout is to preserve a given layout without sacri cing other criteria of layout quality [13] For orthogonal representations, the number of edge bends turn out to be particularly important. Only two approaches for dynamic orthogonal layout are known to us [8, 6]. InteractiveGiotto [8] is an interactive prototype extending a successful static layout algorithm called Giotto [27] It accounts for a user s mental map by retaining the shape of the most recent layout, and introducing the minimum number of bends necessary to make it orthogonal. The approach of ....

....InteractiveGiotto [8] is an interactive prototype extending a successful static layout algorithm called Giotto [27] It accounts for a user s mental map by retaining the shape of the most recent layout, and introducing the minimum number of bends necessary to make it orthogonal. The approach of [6] was devised independently, but is complementary Part of this research carried out while with the Department of Computer Science at Brown University. I gratefully acknowledge the German Academic Exchange Service (DAAD Hochschulsonderprogramm III) for nancial support. in that it does not x ....

[Article contains additional citation context not shown here]

U. Brandes and D. Wagner. Dynamic grid embedding with few bends and changes. In K.-Y. Chwa and O. H. Ibarra, editors, Proceedings of the 9th Annual International Symposium on Algorithms and Computation (ISAAC '98), volume 1533 of Lecture Notes in Computer Science, pages 89-98. Springer, 1998.

No context found.

U. Brandes and D. Wagner, Dynamic grid embedding with few bends and changes. In [57], pp. 89-98.

No context found.

U. Brandes and D. Wagner, Dynamic grid embedding with few bends and changes. In [57], pp. 89-98.

No context found.

U. Brandes and D. Wagner, Dynamic grid embedding with few bends and changes. In [57], pp. 89-98.

No context found.

U. Brandes and D. Wagner, Dynamic grid embedding with few bends and changes. In [57], pp. 89-98.

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