Logo

Login | Create Account

Algorithmic Patterns for Orthogonal Graph Drawing

Gelfand, Natasha and Tamassia, Roberto (1998) Algorithmic Patterns for Orthogonal Graph Drawing. [Conference Paper]

Full text not available from this repository.

Abstract

In this paper, we present an object-oriented design and implementation of the core steps of the GIOTTO algorithm for orthogonal graph drawing. Our design is motivated by the goals of making the algorithm modular and extensible and of providing many reusable components of the algorithm. This work is part of the JDSL project aimed at creating a library of data structures and algorithms in Java.

Item Type:Conference Paper
Classifications:M Methods > M.999 Others
P Styles > P.600 Poly-line > P.600.700 Orthogonal
S Software and Systems > S.999 Others
ID Code:261
Deposited By:Arnopolina, Galina
Deposited On:09 Nov 2004
Last Modified:18 Sep 2008 13:08
Alternative Locations:http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=1547&spage=138

Repository Staff Only: item control page

References

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network Flows. Prentice Hall, 1993.

2. P. Bertolazzi, G. Di Battista, and G. Liotta. Parametric graph drawing. IEEE Trans. Soft. Eng., 21(8):662-673, 1995.

3. S. Bridgeman, A. Garg, and R. Tamassia. A graph drawing and translation service on the WWW. In S.C. North, editor, Proceedings of Graph Drawing '96 (Proc. GD '96), vol. 1190 of LNCS, Springer-Verlag, 1997.

4. G. Di Battista, P. Eades, R. Tamassia, and I.G. Tollis. Graph drawing. Prentice Hall, 1998.

5. G. Di Battista, G. Liotta, and F. Vargiu. Diagram Server. J. Visual Lang. Comput., 6(3):275-298, 1995. (Special issue on Graph Visualization, edited by I.F. Cruz and P. Eades).

6. ffgraph homepage. http://www.fmi.uni-passau.de/~friedric/ffgraph/main.shtml.

7. B. Flaming. Practical algorithms in C++. Coriolis Group Book,1995.

8. G. Gallo and M.G. Scutella. Towards a programming environment for combinatorial optimization: a case study oriented to max-flow computations. ORSA J. Computing, 5:120-133, 1994.

9. E. Gamma, R. Helm, R. Johnson, and J. Vlissides. Design Patterns. Addison-Wesley, 1995.

10. N. Gelfand, M.T. Goodrich, and R. Tamassia. Teaching Data Structure Design Patterns. In Proc 29th ACM SIGCSE Tech. Symp., pages 331-335, 1998.

11. M. Goodrich and R. Tamassia. Data Structures and Algorithms in java. John Wiley, NY, 1998.

12. GDToolkit homepage. http://www.inf.uniroma3.it/people/gdb/wp12/GDT.html.

13. M. Himsolt. The Graphlet System. LNCS, 1190, 1997.

14. H. Lauer, M. Ettrich, and K. Soukup. GraVis - system demonstration. LNCS, 1353, 1997.

15. LEDA homepage. http://www.mpi-sb.mpg.de/LEDA/.

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

17. R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and readability of diagrams. IEEE Transactions on Systems, Man and Cybernetics, SMC-18(1):61-79, 1988.

18. R. Tamassia, L. Vismara, and J.E. Baker. A case study in algorithm engineering for geometric computing. In G.F. Italiano and S. Orlando, editors, Proc. Workshop on Algorithm Engineering, 1997. http://www.dsi.unive.it/~wae97/proceedings/.

19. K. Weihe. Reuse of algorithms: Still a challenge to object-oriented programming. In Proc. OOPSLA-97, pages 34-48. ACM Press, 1997.

GDEA is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.