InteractiveGiotto: An Algorithm for Interactive Orthogonal Graph Drawing

Bridgeman, Stina and Fanto, Jody and Garg, Ashim and Tamassia, Roberto and Vismara, Luca (1998) InteractiveGiotto: An Algorithm for Interactive Orthogonal Graph Drawing. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997, Rome, Italy , pp. 303-308 (Official URL: http://dx.doi.org/10.1007/3-540-63938-1_73).

Full text not available from this repository.

Abstract

We present INTERACTIVEGIOTTO, an interactive algorithm for orthogonal graph drawing based on the network flow approach to bend minimization.

Item Type:Conference Paper
Additional Information:10.1007/3-540-63938-1_73
Classifications:M Methods > M.300 Dynamic / Incremental / Online
G Algorithms and Complexity > G.210 Bends
P Styles > P.600 Poly-line > P.600.700 Orthogonal
ID Code:86

Repository Staff Only: item control page

References

T.C. Biedl and M. Kaufmann. Area-efficient static and incremental graph drawings. In R. Burkhard and G. Woeginger, editors, Algorithms (Proc. ESA '97) volume 1284 of Lecture Notes Comput. Sci., pages 37-52. Springer-Verlag, 1997.

R.F. Cohen, G. Di Battista, R. Tamassia, and I.G. Tollis. Dynamic graph drawings: Trees, series-parallels digraphs, and planar ST-digraphs. SIAM J. Comput., 24(5):970-1001, 1995.

P. Eades, W. Lai, K. Misue, and K. Sugiyama. Preserving the mental map of a diagram. In Proceedings of Compugraphics 91, pages 24-33, 1991.

W. He and K. Marriott. Constrained graph layout. In S. North, editor, Graph Drawing (Proc. GD '96), volume 1190 of Lecture Notes Comput. Sci., pages 217-232. Springer-Verlag, 1997.

K. Melhorn and S. Näher. LEDA: a platform for combinatorial and geometric computing. Commun. ACM, 38:96-102, 1995.

K. Miriyala, S.W. Hornick, and R. Tamassia. An incremental approach to aesthetic graph layout. In Proc. Internat. Workshop on Computer-Aided Software Engineering, 1993.

K. Misue, P. Eades, W. Lai, and K. Sugiyama. Layout adjustment and the mental map. J. Visual Lang. Comput., 6:183-210, 1995.

S. Moen. Drawing dynamic trees. IEEE Softw., 7:21-28, 1990.

S. North. Incremental layout in DynaDAG. In F.J. Brandenburg, editor, Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes Comput. Sci., pages 109-418. Springer-Verlag, 1996.

A. Papakostas, J.M. Six, and I.G. Tollis. Experimental and theoretical results in interactive orthogonal graph drawing. In S. North, editor, Graph Drawing (Proc. GD '96), volume 1190 of Lecture Notes Comput. Sci., pages 371-386. Springer-Verlag, 1997.

A. Papakostas and I.G. Tollis. Interactive orthogonal graph drawing. Technical report, The University of Texas at Dallas, 1996. http://www.utdallas.edu/~tollis/papers/interactive_J.ps

A. Papakostas and I.G. Tollis. Issues in interactive orthogonal graph drawing. In F.J. Brandenburg, editor, Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes Comput. Sci., pages 419-430. Springer-Verlag, 1996.

K. Ryall, J. Marks, and S. Shieber. An interactive system for drawing graphs. In S. North, editor, Graph Drawing (Proc. GD '96), volume 1190 of Lecture Notes Comput. Sci., pages 387-394. Springer-Verlag, 1997.

R. Tamassia. New layout techniques for entity-relationship diagrams. In Proc. 4th Internat. Conf. on Entity-Relationship Approach, pages 304-311, 1985.

R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput., 16(3):421-444, 1987.

R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and readability of diagrams. IEEE Trans. Syst. Man. Cybern., SMC-18(1):61-79, 1988.