Abstract
We present InteractiveGiotto, an interactive algorithm for orthogonal graph drawing based on the network flow approach to bend minimization.
Research supported in part by the U.S. Army Research Office under grant DAAH0496-1-0013, by the National Science Foundation under grant CCR-9423847, and by a National Science Foundation Graduate Fellowship.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
T. C. Biedl and M. Kaufmann. Area-efficient static and incremental graph darwings. In R. Burkard 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-parallel 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. Mehlhorn 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. CD '95), volume 1027 of Lecture Notes Comput. Sci., pages 409–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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bridgeman, S.S., Fanto, J., Garg, A., Tamassia, R., Vismara, L. (1997). InteractiveGiotto: An algorithm for interactive orthogonal graph drawing. In: DiBattista, G. (eds) Graph Drawing. GD 1997. Lecture Notes in Computer Science, vol 1353. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63938-1_73
Download citation
DOI: https://doi.org/10.1007/3-540-63938-1_73
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63938-1
Online ISBN: 978-3-540-69674-2
eBook Packages: Springer Book Archive