GEOMI: GEOmetry for Maximum Insight

Xu, Kai and Hong, Seok-Hee and Forster, Michael and Nikolov, Nikola S. and Ho, Joshua and Koschutzki, Dirk and Ahmed, Adel and Dwyer, Tim and Fu, Xiaoyan and Murray, Colin and Taib, Ronnie and Tarassov, Alexandre (2006) GEOMI: GEOmetry for Maximum Insight. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005, Limerick, Ireland , pp. 468-479 (Official URL:

Full text not available from this repository.


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 a new generation of visual analysis tools combining graph visualisation techniques with network analysis methods. GEOMI is available from

Item Type:Conference Paper
Additional Information:10.1007/11618058_42
Classifications:S Software and Systems > S.001 General
ID Code:714

Repository Staff Only: item control page


Dwyer, T.: Extending the WilmaScope 3D graph visualisation system - software demonstration. Proceeding of Asia-Pacific Symposium on Information Visualisation 2005 (APVIS2005). (2005) 35-42

Madadhain, J.O., Fisher, D., Smyth, P., White, S., Boey, Y.B.: Analysis and visualization of network data using JUNG. (2005)

Dwyer, T., Hong, S.H., Koschützki, D., Schreiber, F., Xu, K.: Visual analysis of network centralities. Planed submission for APvis 2006. (2005)

Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge Univ. Press (1994)

Hong, S.H., Nikolov, N.S.: Hierarchical layouts of directed graphs in three dimensions. Technical report, National ICT Australia Ltd. (NICTA) (2005)

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)

Tarassov, A., Nikolov, N.S., Branke, J.: A heuristic for minimum-width of graph layering with consideration of dummy nodes. Experimental and Efficient Algorithms, Third International Workshop. Lecture Notes in Computer Science, Springer-Verlag (2004) 570-583

Hong, S.H., Nikolov, N.S.: Layered drawings of directed graphs in three dimensions. Information Visualisation 2005: Asia-Pacific Symposium on Information Visualisation (APVIS2005), CRPIT (2005) 69-74

Brandes, U., Köpf, B.: Fast and simple horizontal coordinate assignment. Mutzel, P., Jünger, M., S., L., eds.: Graph Drawing: Proceedings of 9th International Symposium, GD 2001. Volume 2265 of Lecture Notes in Computer Science., Springer-Verlag (2002) 31-44

Ho, J., Hong, S.H.: Drawing clustered graphs in three dimensions. to appear in the proceedings of 13th International Symposium on Graph Drawing (GD2005) (2005)

Baur, M., Brandes, U.: Crossing reduction in circular layouts. Proceedings on 30th International Workshop Graph-Theorectic Concepts in Computer Sciecne. (2004) 332-343

Ahmed, A., Dwyer, T., Hong, S.H., Murray, C., Song, L., Wu, Y.X.: Visualisation and analysis of large and complex scale-free networks. Proceedings Eurographics / IEEE VGTC Symposium on Visualization (EuroVis 2005). (2005) to appear