GEOMI: GEOmetry for Maximum Insight

  • Adel Ahmed
  • Tim Dwyer
  • Michael Forster
  • Xiaoyan Fu
  • Joshua Ho
  • Seok-Hee Hong
  • Dirk Koschützki
  • Colin Murray
  • Nikola S. Nikolov
  • Ronnie Taib
  • Alexandre Tarassov
  • Kai Xu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3843)

Abstract

This paper describes the GEOMI system, a visual analysis tool for the visualisation and analysis of large and complex networks. GEOMI provides a collection of network analysis methods, graph layout algorithms and several graph navigation and interaction methods. GEOMI is part of a new generation of visual analysis tools combining graph visualisation techniques with network analysis methods. GEOMI is available from http://www.cs.usyd.edu.au/~visual/valacon/geomi/.

References

  1. 1.
    Dwyer, T.: Extending the WilmaScope 3D graph visuzlisation system - software demonstration. In: Proceeding of Asia-Pacific Symposium on Information Visualisation 2005 (APVIS 2005), pp. 35–42 (2005)Google Scholar
  2. 2.
    Madadhain, J.O., Fisher, D., Smyth, P., White, S., Boey, Y.B.: Analysis and visualization of network data using JUNG (2005), http://jung.sourceforge.net
  3. 3.
    Dwyer, T., Hong, S.H., Koschützki, D., Schreiber, F., Xu, K.: Visual analysis of network centralities. In: Planed submission for APvis 2006 (2005)Google Scholar
  4. 4.
    Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge Univ. Press, Cambridge (1994)Google Scholar
  5. 5.
    Hong, S.H., Nikolov, N.S.: Hierarchical layouts of directed graphs in three dimensions. Technical report, National ICT Australia Ltd., NICTA (2005)Google Scholar
  6. 6.
    Nikolov, N., Tarassov, A.: Graph layering by promotion of nodes. Special issue of Discrete Applied Mathematics associated with the IV ALIO/EURO Workshop on Applied Combinatorial Optimization (to appear)Google Scholar
  7. 7.
    Tarassov, A., Nikolov, N.S., Branke, J.: A heuristic for minimum-width of graph layering with consideration of dummy nodes. In: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004. LNCS, vol. 3059, pp. 570–583. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  8. 8.
    Hong, S.H., Nikolov, N.S.: Layered drawings of directed graphs in three dimensions. In: Information Visualisation 2005: Asia-Pacific Symposium on Information Visualisation (APVIS 2005), pp. 69–74. CRPIT (2005)Google Scholar
  9. 9.
    Brandes, U., Köpf, B.: Fast and simple horizontal coordinate assignment. In: Mutzel, P., Jünger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 31–44. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  10. 10.
    Ho, J., Hong, S.H.: Drawing clustered graphs in three dimensions. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 492–502. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  11. 11.
    Baur, M., Brandes, U.: Crossing reduction in circular layouts. In: Proceedings on 30th International Workshop Graph-Theorectic Concepts in Computer Sciecne, pp. 332–343 (2004)Google Scholar
  12. 12.
    Ahmed, A., Dwyer, T., Hong, S.H., Murray, C., Song, L., Wu, Y.X.: Visualisation and analysis of large and complex scale-free networks. In: Proceedings Eurographics / IEEE VGTC Symposium on Visualization, EuroVis 2005 (2005) (to appear)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Adel Ahmed
    • 1
    • 2
  • Tim Dwyer
    • 3
  • Michael Forster
    • 1
  • Xiaoyan Fu
    • 1
  • Joshua Ho
    • 2
  • Seok-Hee Hong
    • 1
    • 2
  • Dirk Koschützki
    • 5
  • Colin Murray
    • 1
    • 2
  • Nikola S. Nikolov
    • 1
    • 4
  • Ronnie Taib
    • 1
  • Alexandre Tarassov
    • 1
    • 4
  • Kai Xu
    • 1
  1. 1.IMAGEN ProgramNational ICT AustraliaSydneyAustralia
  2. 2.School of ITThe University of SydneySydneyAustralia
  3. 3.Monash UniversityMelbourneAustralia
  4. 4.Department of CSISUniversity of LimerickLimerickRepublic of Ireland
  5. 5.Institute of Plant Genetics and Crop Plant ResearchGaterslebenGermany

Personalised recommendations