3D Graph Drawings: Good Viewing for an Occluded Edges

  IJCTT-book-cover
 
International Journal of Computer Trends and Technology (IJCTT)          
 
© 2015 by IJCTT Journal
Volume-27 Number-2
Year of Publication : 2015
Authors : Tariq O. Fadl Elsid, Samani A. Talab
  10.14445/22312803/IJCTT-V27P115

MLA

Tariq O. Fadl Elsid, Samani A. Talab "3D Graph Drawings: Good Viewing for an Occluded Edges". International Journal of Computer Trends and Technology (IJCTT) V27(2):87-92, September 2015. ISSN:2231-2803. www.ijcttjournal.org. Published by Seventh Sense Research Group.

Abstract -
The growing studies show that the human brain can comprehend increasingly complex structures if they are displayed as objects in three dimensional spaces. In addition to that, recent trends of information technology advances have led to the yielding of a lot of data, and consequently have led to many large and complex models of 3D graph drawings in many domains. 3D graph drawing and presentation techniques are combined available at interactive speed. Even large graphs with hundreds of vertices can be meaningfully displayed by enhancing the presentation with additional attributes of graph drawings and the possibility of interactive user navigation. Good Drawing (Visualization) resolves the problems of the occluded structures of the graph drawings and amplifies human understanding, thus leading to new insights of information visualization. The aim of this paper is to describe our work, which usesa force-directed algorithm as a framework to address problem edge-edge occlusions. The yielding three dimensional graph drawings conform to various standard criteria layout aesthetics of good viewing graphs. The implementation of the work is done by Gephi package, which has built-in force directed layout algorithms, specifically Fruchterman and Reingold approach. We interactively visualize many 3D graphs of different size and complexity to support our method. The result shows that our work is capable of producing good viewpoints for 3D graph drawing,by usingFruchterman and Reingold algorithm.

References
[1]Bastian, Mathieu, Sebastien Heymann, and Mathieu Jacomy. "Gephi: an open source software for exploring and manipulating networks." ICWSM 8 (2009): 361-362.
[2] Bhowmick, Sanjukta, and Suzanne M. Shontz. "Towards highquality, untangled meshes via a force-directed graph embedding approach." Procedia Computer Science 1.1 (2010): 357- 366.
[3] Brasch, Steffen,"Interactive visualization for the exploration of aligned biological networks and their evolution",Greifswald, Univ., Diss.,'http://d-nb.info/1025718712' 2011,
[4] Bastian, Mathieu, Sebastien Heymann, and Mathieu Jacomy. "Gephi: An Open Source Software for Explorating and Manipulating Networks." (2009).
[5] Chernobelskiy, R.; Cunningham, K.; Goodrich, M. T.; Kobourov, S. G.; Trott, L. (2011), "Force-directed Lombardi-style graph drawing", Proc. 19th Symposium on Graph Drawing (PDF), pp. 78–90.
[6]https://consortium.gephi.org/members.html Retrieved 2015-08- 19
[7] Davidson, Ron, and David Harel. "Drawing graphs nicely using simulated annealing." ACM Transactions on Graphics (TOG) 15.4 (1996): 301-331.
[8]Eades, Peter, Michael E. Houle, and Richard Webber. "Finding the best viewpoints for three-dimensional graph drawings." Graph Drawing. Springer Berlin Heidelberg, 1997.
[9] Fruchterman, Thomas MJ, and Edward M. Reingold. "Graph drawing by force‐directed placement." Software: Practice and experience 21.11 (1991): 1129-1164.
[10] Gansner, Emden R., Yehuda Koren, and Stephen C. North. "Topological fisheye views for visualizing large graphs." Visualization and Computer Graphics, IEEE Transactions on 11.4 (2005): 457-468.
[11] http://gephi.github.io/
[12] Hachul, Stefan. A Potential-Field-Based Multilevel Algorithm for Drawing Large Graphs. Diss. Universität zu Köln, 2005.
[13] Harel, David, and Yehuda Koren. "A fast multi-scale method for drawing large graphs." Graph drawing. Springer Berlin Heidelberg, 2001.
[14]Hong, Seok-Hee. "MultiPlane: a new framework for drawing graphs in three dimensions." Graph drawing. Springer Berlin Heidelberg, 2006.
[15]Houle, Michael E., and Richard Webber. "Approximation algorithms for finding best viewpoints." Graph Drawing. Springer Berlin Heidelberg, 1998.
[16] Hu, Yifan. "Efficient, high-quality force-directed graph drawing." Mathematica Journal 10.1 (2005): 37-71.
[17] KAMADA, Tomihisa, and Satoru KAWAI. "AN ALGORITHM FOR DRAWING GENERAL UNDIRECTED GRAPHS." Information Processing Letters 31, 1989
[18]Lespinats, Sylvain, Alain Giron, and Bernard Fertil. "Visualization and exploration of highdimen- sional data using a" force directed placement" method: application to the analysis of genomic signatures."
[19] Lin, Chun-Cheng, and Hsu-Chun Yen. "A new force-directed graph drawing method based on edge–edge repulsion." Journal of Visual Languages & Computing 23.1 (2012): 29-42.
[20] Poorna Banerjee Dasgupta "Algorithmic Analysis of Edge Ranking and Profiling for MTF Determination of an Imaging System". International Journal of Computer Trends and Technology (IJCTT) V23(1):46-48, May 2015. ISSN:2231-2803. www.ijcttjournal.org. Published by Seventh Sense Research Group.
[21] Purchase, Helen C., Robert F. Cohen, and Murray James. "Validating graph drawing aesthetics." Graph Drawing. Springer Berlin Heidelberg, 1996.
[22] Sugiyama, Kozo, and Kazuo Misue. "Graph drawing by the magnetic spring model." Journal of Visual Languages and Computing 6.3 (1995): 217-231.
[23] Wang, Qi, et al. "3DScapeCS: application of three dimensional, parallel, dynamic network visualization in Cytoscape." BMC bioinformatics 14.1 (2013): 322.
[24] Ware, Colin. "Designing with a 2 1/2-D attitude." Information Design Journal 10.3 (2001): 258-258.
[25] http://www-personal.umich.edu/~mejn/netdata/

Keywords
3D Graph Drawings, 3D Graph Visualization, Edge-edge Occlusion, force-directed layout, Good Viewpoint, Gephi.