Dynamic Grid Embedding with Few Bends and Changes

Cite This

Files in this item

Checksum: MD5:405c0d24996d45648f45b16612b63659

BRANDES, Ulrik, Dorothea WAGNER, 1998. Dynamic Grid Embedding with Few Bends and Changes

@unpublished{Brandes1998Dynam-6429, title={Dynamic Grid Embedding with Few Bends and Changes}, year={1998}, author={Brandes, Ulrik and Wagner, Dorothea} }

application/pdf 1998 2011-03-24T16:12:40Z Wagner, Dorothea Wagner, Dorothea terms-of-use eng Brandes, Ulrik Brandes, Ulrik Dynamic Grid Embedding with Few Bends and Changes 2011-03-24T16:12:40Z In orthogonal graph drawing, edges are represented by sequences of horizontal and vertical straight line segments. For graphs of degree at most four, this can be achieved by embedding the graph in a grid. The number of bends displayed is an important criterion for layout quality. A well-known algorithm of Tamassia efficiently embeds a planar graph with fixed combinatorial embedding and vertex degree at most four in the grid such that the number of bends is minimum.<br /><br />When given a dynamic graph, i.e. a graph that changes over time, one has to take into account not only the static criteria of layout quality, but also the effort users spent to regain familiarity with the layout. Therefore, consecutive layouts should compromize between quality and change. We here extend Tamassia's layout model to dynamic graphs in a way that allows to specify the relative importance of the number of bends vs. the number of changes between consecutive layouts. We also show that optimal layouts in the dynamic model can be computed efficiently by means that are very similar to the static model, namely by solving a minimum cost flow problem in a suitably defined network.

Downloads since Oct 1, 2014 (Information about access statistics)

preprint_069.pdf 341

This item appears in the following Collection(s)

Search KOPS


My Account