Abstract
Motivated by the wide variety of applications in many different fields, new graph drawing algorithms are continually being developed and implemented. However, there are many barriers in the way of someone wishing to make use of this technology. First, a potential user must know that the technology exists, which often means she must be well-versed in the terminology and literature of the graph drawing community. Then she must locate and install an implementation, which requires that the software creators provided the correct executable for her environment, or that she has the knowledge and tools to build the application from source code. Running the newly-installed program requires sufficient computational resources (CPU power, memory, disk space). Finally, due to the wealth of different graph description formats, it is likely that she must convert her data to the format used by the program. Another translation step may be required at the end, if the program does not output the data in a format she can use. Overall, this process is time-consuming for even an expert user, and may be prohibitively difficult for the casual or novice user.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alberts, D., Gutwenger, C., Mutzel, P., Näher, S. (1997) AGD-Library: A library of algorithms for graph drawing. In: Proceedings of the Workshop on Algorithm Engineering, 112–123 http://www.mpi-sb.mpg.de/AGD/
Barequet, G., Bridgeman, S., Duncan, C., Goodrich, M., Tamassia, R. (1999) GeomNet: Geometric computing over the Internet. IEEE Internet Computing 3(2), 21–29
Barequet, G., Bridgeman, S. S., Duncan, C. A., Goodrich, M. T., Tamassia, R. (1997) Classical computational geometry in GeomNet. In: Proceedings of the 13th Annual ACM Symposium on Computational Geometry, 412–414
Beccaria, M., Bertolazzi, P., Di Battista, G., Liotta, G. (1991) A tailorable and extensible automatic layout facility. In: Proceedings of the IEEE Workshop on Visual Languages, 68–73
Bertolazzi, P., Cohen, R. F., Di Battista, G., Tamassia, R., Tollis, I. G. (1994) How to draw a series-parallel digraph. International Journal on Computational Geometry and Applications 4, 385–402
Biedl, T., Kant, G. (1998) A better heuristic for orthogonal graph drawings. Computational Geometry: Theory and Applications 9, 159–180
Brandes, U., Eiglsperger, M., Herman, I., Himsolt, M., Marshall, M. S. (2002) GraphML progress report: Structural layout proposal. In: P. Mutzel, M. Jünger, S. Leipert (eds.) Graph Drawing’ 01, Lecture Notes in Computer Science 2265, Springer-Verlag, 501–512
Bridgeman, S., Garg, A., Tamassia, R. (1999) A graph drawing and translation service on the WWW. International Journal on Computational Geometry and Application 9(4–5), 419–446
Bridgeman, S., Goodrich, M. T., Kobourov, S. G., Tamassia, R. (2000) PILOT: An interactive tool for learning and grading. In: Proceedings of the ACM Technical Symposium on Computer Science Education (SIGCSE), 139–143
Chan, T. M., Goodrich, M. T., Kosaraju, S. R., Tamassia, R. (2002) Optimizing area and aspect ratio in straight-line orthogonal tree drawings. Computational Geometry 23(2), 153–162
Di Battista, G., Giammarco, A., Santucci, G., Tamassia, R. (1990) The architecture of Diagram Server. In: Proceedings of the IEEE Workshop on Visual Languages, 60–65
Di Battista, G., Liotta, G., Vargiu, F. (1995) Diagram Server. Journal of Visual Language Computing 6(3), 275–298. Special issue on Graph Visualization, I. F. Cruz and P. Eades (eds.)
Frick, A., Ludwig, A., Mehldau, H. (1995) A fast adaptive layout algorithm for undirected graphs. In: R. Tamassia, I. G. Tollis (eds.) Graph Drawing’ 94, Lecture Notes in Computer Science 894, Springer-Verlag, 388–403.
GD Toolkit. http://www.dia.uniroma3.it/~gdt/.
Herman, I., Marshall, M. S. (2000) GraphXML — an XML-based graph description format. In: J. Marks (ed.) Graph Drawing’ 00, Lecture Notes in Computer Science 1984, Springer-Verlag, 52–62.
Himsolt, M. (1996) GML: Graph modelling language. Manuscript, Universität Passau, Innstraβe 33, 94030 Passau, Germany http://infosun.fmi.uni-passau.de/Graphlet/GML/.
Mehlhorn, K., Näher, S. (2000) LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge, UK http://www.mpi-sb.mpg.de/LEDA/leda.html.
Papakostas, A., Tollis, I. G. (1998) Algorithms for area-efficient orthogonal drawings. Computational Geometry: Theory and Applications 9(1–2), 83–110, special Issue on Geometric Representations of Graphs, G. Di Battista and R. Tamassia (eds.)
Punin, J., Wang, Y.-X., Krishnamoorthy, M. XGMML. http://www.es.rpi.edu/~puninj/XGMML/.
Tamassia, R., Tollis, I. G. (1989) Planar grid embedding in linear time. IEEE Transactions on Circuits and Systems CAS-36(9), 1230–1234
Winter, A. (2002) Exchanging graphs with GXL. In: P. Mutzel, M. Jünger, S. Leipert (eds.) Graph Drawing’ 01, Lecture Notes in Computer Science 2265, Springer-Verlag, 485–500
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bridgeman, S., Tamassia, R. (2004). GDS — A Graph Drawing Server on the Internet. In: Jünger, M., Mutzel, P. (eds) Graph Drawing Software. Mathematics and Visualization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18638-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-18638-7_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-62214-4
Online ISBN: 978-3-642-18638-7
eBook Packages: Springer Book Archive