Issues in Interactive Orthogonal Graph Drawing

Papakostas, Achilleas and Tollis, Ioannis G. (1996) Issues in Interactive Orthogonal Graph Drawing. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995, Passau, Germany , pp. 419-430 (Official URL: http://dx.doi.org/10.1007/BFb0021825).

Full text not available from this repository.

Abstract

Several applications require human interaction during the design process. The user is given the ability to alter the graph as the design progresses. Interactive Graph Drawing gives the user the ability to dynamically interact with the drawing. In this paper we discuss features that are essential for an interactive drawing system. We also describe some possible interactive drawing scenaria and present results on two of them. In these results we assume that the underline drawing is always orthogonal and the maximum degree of any vertex is at most four at the end of any update operation.

Item Type:Conference Paper
Additional Information:10.1007/BFb0021825
Classifications:J Applications > J.999 Others
M Methods > M.300 Dynamic / Incremental / Online
G Algorithms and Complexity > G.999 Others
P Styles > P.600 Poly-line > P.600.700 Orthogonal
S Software and Systems > S.999 Others
ID Code:185

Repository Staff Only: item control page

References

Therese Biedl, Embedding Nonplanar Graphs in the Rectangular Grid, Rutcor Research Report 27-93, 1993

T. Biedl and G. Kant, A Better Heuristic for Orthogonal Graph Drawings, Proc. 2nd Ann. European Symposium on Algorithms (ESA '94), Lecture Notes in Computer Science, vol. 855, pp. 24-35, Springer-Verlag, 1994.

R. Cohen, G. Di Battista, R. Tamassia and I. G. Tollis, Dynamic Graph Drawing, to appear in SIAM Journal on Computing.

G. Di Battista, P. Eades, R. Tamassia and I. Tollis, Algorithms for Drawing Graphs: An Annotated Bibliography, Computational Geometry: Theory and Applications, vol. 4, no 1994, pp. 235-282. Also available via anonymous ftp from ftp.cs.brown.edu, gdbiblio.tex.Z and gdbiblio.ps.Z in /pub/papers/compgeo.

G. Di Battista, G. Liotta and F. Vargiu, Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs, Proc. Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science 709, Springer-Verlag, 1993, pp. 151-162.

S. Even and G. Granot, Rectilinear Planar Drawings with Few Bends in Each Edge, Tech. Report 797, Comp. Science Dept., Technion, Israel Inst. of Tech., 1994

S. Even and R. E. Tarjan, Computing an st-numbering, Theor. Comp. Sci. 2 (1976), pp. 339-344.

A. Garg and R. Tamassia, On the Computational Complexity of Upward and Rectilinear Planarity Testing, Proc. DIMACS Workshop GD '94, Lecture Notes in Comp. Sci. 894, Springer-Verlag, 1994, pp. 286-297.

Goos Kant, Drawing planar graphs using the lmc-ordering, Proc. 33th Ann. IEEE Symp. on Found. of Comp. Science, 1992, pp. 101-110.

F. T. Leighton, New lower bound techniques for VLSI, Proc. 22nd Ann. IEEE Symp. on Found. of Comp. Science, 1981, pp. 1-12.

Charles E. Leiserson, Area-Efficient Graph Layouts (for VLSI), Proc. 21st Ann. IEEE Symp. on Found. of Comp. Science, 1980, pp. 270-281.

Thomas Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, John Wiley and Sons, 1990.

K. Miriyala, S. W. Hornick and R. Tamassia, An Incremental Approach to Aesthetic Graph Layout, Proc. Int. Workshop on Computer-Aided Software Engineering (Case '93), 1993.

A. Papakostas and I. G. Tollis, Algorithms for Area-Efficient Orthogonal Drawings, journal version, in preparation.

A. Papakostas and I. G. Tollis, Improved Algorithms and Bounds for Orthogonal Drawings, Proc. DIMACS Workshop GD '94, Lecture Notes in Comp. Sci. 894, Springer-Verlag, 1994, pp. 40-51

Markus Schäffter, Drawing Graphs on Rectangular Grids, Discr. Appl. Math. (to appear).

J. Storer, On minimal node-cost planar embeddings, Networks 14 (1984), pp. 181-212.

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

R. Tamassia and I. Tollis, Planar Grid Embeddings in Linear Time, IEEE Trans. on Circuits and Systems CAS-36 (1989), pp. 1230-1234.

R. Tamassia, I. Tollis and J. Vitter, Lower Bounds for Planar Orthogonal Drawings of Graphs, Information Processing Letters 39 (1991), pp. 35-40.

L. Valiant, Universality Considerations in VLSI Circuits, IEEE Trans. on Comp., vol. C-30, no 2, (1981), pp. 135-140.