Abstract

Metrovis is an extensible graph drawing package with Silverlight technology. This package is a web base tool to present the octilinear layout of a graph. It provides an application programming interface (API) on top of which Web-based applications that need to visualize any entities in terms of graphs. This layout has got many application such as representation of thesis map, designing the web pages. Metrovis, could be enhanced in any platform, and it's compatible by any algorithm. To illustrate its application, it has been performed with the real metro maps.

References

• A. Frick, A. Ludwig and H. Mehldau, 1995. A Fast Adaptive Layout Algorithm for Undirected Graphs, Proc. of Graph Drawing 94, LNCS 894, pp. 388-403, Springer Verlag,.
• D. Merrick and J. 2007. Gudmundsson. Path simplification for metro map layout. In Pro Graph drawing, pp. 258-269.
• E. S. Sandvad, K. Gronbak, L. Sloth and J. L. Knudsen, 2001. Metro Map Metaphor for Guided Tours on the Web: the Webvise guided Tour system, Proc. of InternationalConference on World Wide Web, pp. 326-333.
• F. Bertault, 1999. A Force-Directed Algorithm that Preserves Edge Crossing Properties, Graph Drawing 99, LNCS 1731, pp. 351-358, Springer Verlag.
• H. de Frayssex, J. Pach, and R. Pollack, 1990. How to Draw a Planar Graph on a Grid. Combinatorica , pp. 41-51.
• J. M. Stott and P. Rodgers, 2004. Metro Map Layout Using Multicriteria Optimization, Proc. of International Conference on Information Visualisation (IV04), pp. 355-362.
• K. Nesbitt, 2003. Multi-sensory display of abstract data, Ph. D. Thesis, University of Sydney, Australia.
• M. Nollenburg and A. Wolff, 2005. A Mixed Integer Program for Drawing High Quality Metro Maps. In Proc 13th International Symposium on Graph Drawing. VerlagBerlinHeidelberg, Springer.
• P. Chaleat, D. Charnay, 1998. Programmation Html, JavaScript, Paris, Eyrolles.
• P. Lacomme, C. Prints, M. Sevaux , 2003. Algorithmes de Graphes. Ed. Eyrolles, 2th.
• R. Tamassia. 1987. On Embedding a Graph in the Grid with the Minimum Number of Bends. SIAM Journal of Computing. Vol. 16. No. 3. pp. 421-444.
• R. Laurini, D. Thompson, 1993. Fundamentals of Spatial Information Systems. Academic Press.
• R. Davidson and D. Harel, 1993. Drawing Graphs Nicely Using Simulated Annealing. Technical ReportCS89-13, Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, Israel, ACM.
• R. Laurini. 2001. Information Systems for Urban Planning. A Hypermedia Cooperative Approach, Taylor and Francis.
• S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi, 1983. 'Optimization by simulated annealing', Science, 220,(4598), pp. 671–680.
• S. Maccari, S. Martin. 2004. HTML & JavaScript. Paris, Micro Application.
• S. Hong, D. Merrick, 2006. Automatic Visualisation of Metro Maps. Journal of Visual Languages & Computing, vol. 17, PP. 203-224.
• T. M. J. Frachterman and E. M. Reingold. 1991. Graph Drawing by Force-Directed Placement. Software Practice and Experience, pp. 1129-1164.
• T. Masui, 1994. Evolutionary Learning of Graph Layout Constraints from Examples. ACM, November 2-4, pp. 103-108.
• T. Bang, 2001. Knowledge Sharing in a Learning Resource Centre by Way of a Metro Map Metaphor. 67th IFLA Council and General Conference, Boston.
• T. Bang, K. Gronbak, P. S. Hansen, 2002. Using a metro map metaphor for organizing web-based learning resources, In Proc. of ED-MEDIA 2002, pp. 647–652.
• W. He and K. Marriott, 1998. Constrained graph layout. An international journal,pp. 289-314.