Skip to main content
SpringerLink
Log in

Near-Optimal Concentric Circles Layout

  • Conference paper
  • First Online:
Advances in Visual Computing (ISVC 2020)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 12510))

Included in the following conference series:

  • 1568 Accesses

Abstract

The majority of graph visualization algorithms emphasize improving the readability of graphs by focusing on various vertex and edge rendering techniques. However, revealing the global connectivity structure of a graph by identifying significant vertices is an important and useful part of any graph analytics system. Centrality measures reveal the “most important” vertices of a graph, commonly referred to as central or influential vertices. Hence, a centrality-oriented visualization may highlight these important vertices and give deep insights into graph data. This paper proposes a mathematical optimization-based clustered graph layout called Near-Optimal Concentric Circles (NOCC) layout to visualize medium to large scale-free graphs. We cluster the vertices by their betweenness values and optimally place them on concentric circles to reveal the extensive connectivity structure of the graph while achieving aesthetically pleasing layouts. Besides, we incorporate different edge rendering techniques to improve graph readability and interaction.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    http://ab-initio.mit.edu/wiki/index.php/NLopt.

  2. 2.

    http://www3.hi.is/~tpr/papers/RuYa05.pdf.

  3. 3.

    http://konect.uni-koblenz.de/networks/maayan-figeys.

References

  1. 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: EuroGraphics/IEEE EuroVis (2005)

    Google Scholar 

  2. Andersen, R., Chung, F., Lu, L.: Drawing power law graphs. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 12–17. Springer, Heidelberg (2005). https://doi.org/10.1007/978-3-540-31843-9_2

    Chapter  MATH  Google Scholar 

  3. Baur, M., Brandes, U., Gaertler, M., Wagner, D.: Drawing the AS graph in 2.5 dimensions. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 43–48. Springer, Heidelberg (2005). https://doi.org/10.1007/978-3-540-31843-9_6

    Chapter  MATH  Google Scholar 

  4. Bertini, E.: Social networks visualization: a brief survey (2005)

    Google Scholar 

  5. Binucci, C., Liotta, G., Montecchiani, F., Tappini, A.: Partial edge drawing: homogeneity is more important than crossings and ink. In: 2016 7th International Conference on Information, Intelligence, Systems and Applications (IISA), pp. 1–6 (2016)

    Google Scholar 

  6. Castermans, T., et al.: Solarview: low distortion radial embedding with a focus. IEEE Trans. Visual Comput. Graphics 25, 2969–2982 (2018)

    Article  Google Scholar 

  7. Chan, D.S.M., Chua, K.S., Leckie, C., Parhar, A.: Visualisation of power-law network topologies. In: IEEE International Conference on Networks, pp. 69–74. Sydney, Australia (2003)

    Google Scholar 

  8. Chiasserini, C.F., Garetto, M., Leonardi, E.: Social network de-anonymization under scale-free user relations. IEEE/ACM Trans. Netw. 24(6), 3756–3769 (2016). http://dblp.uni-trier.de/db/journals/ton/ton24.html#ChiasseriniGL16

  9. Chou, J.K., Yang, C.K.: PaperVis: literature review made easy. Comput. Graphics Forum (2011). https://doi.org/10.1111/j.1467-8659.2011.01921.x

    Article  Google Scholar 

  10. Correa, C.D., Ma, K.L.: Visualizing Social Networks, pp. 307–326. Springer, US, Boston, MA (2011)

    Google Scholar 

  11. Dianati, N.: Unwinding the hairball graph: pruning algorithms for weighted complex networks. Phys. Rev. E 93, 012304 (2016)

    Article  MathSciNet  Google Scholar 

  12. Ding, Y., Li, X., Tian, Y., Ledwich, G., Mishra, Y., Zhou, C.: Generating scale-free topology for wireless neighbourhood area networks in smart grid. IEEE Trans. Smart Grid 10, 4245–4252 (2018). https://doi.org/10.1109/TSG.2018.2854645

    Article  Google Scholar 

  13. Eades, P.: Drawing Free Trees. IIAS-RR, International Institute for Advanced Study of Social Information Science, Fujitsu Limited (1991)

    Google Scholar 

  14. Etemad, K., Samavati, F., Carpendale, S.: Daisy visualization for graphs. In: Proceedings of the Joint Symposium on Computational Aesthetics and Sketch Based Interfaces and Modeling and Non-Photorealistic Animation and Rendering, pp. 103–112. Expresive 2016, Eurographics Association, Aire-la-Ville, Switzerland, Switzerland (2016). http://dl.acm.org/citation.cfm?id=2981324.2981340

  15. Fujita, Y., Fujiwara, Y., Souma, W.: Visualizing large-scale structure of a million-firms economic network. In: SIGGRAPH Asia 2015 Visualization in High Performance Computing (SA 2015), pp. 13:1–13:4. ACM, New York, NY, USA (2015). https://doi.org/10.1145/2818517.2818525, http://doi.acm.org/10.1145/2818517.2818525

  16. Giot, R., Bourqui, R.: Fast graph drawing algorithm revealing networks cores. In: International Conference on Information Visualisation, pp. 259–264. Barcelona, Spain (2015)

    Google Scholar 

  17. Guo, X., Chen, H., Liu, X., Xu, X., Chen, Z.: The scale-free network of passwords : visualization and estimation of empirical passwords. CoRR abs/1511.08324 (2015)

    Google Scholar 

  18. 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). https://doi.org/10.1007/11618058_44

    Chapter  MATH  Google Scholar 

  19. Itoh, T., Klein, K.: Key-node-separated graph clustering and layouts for human relationship graph visualization. IEEE Comput. Graphics Appl. 35(6), 30–40 (2015). http://dblp.uni-trier.de/db/journals/cga/cga35.html#ItohK15

  20. Jeong, H., Mason, S., Barabási, A.L., Oltvai, Z.: Lethality and centrality in protein networks. Nature 411, 41–42 (2001)

    Article  Google Scholar 

  21. Jia, Y., Hoberock, J., Garland, M., Hart, J.: On the visualization of social and other scale-free networks. IEEE Trans. Visual Comput. Graphics 14(6), 1285–1292 (2008)

    Article  Google Scholar 

  22. Joy, M., Brock, A., Ingber, D.E., Huang, S.: High-betweenness proteins in the yeast protein interaction network. J. Biomed. Biotech. 2005, 96–103 (2005)

    Article  Google Scholar 

  23. Knuth, D.E.: Computer-drawn flowcharts. Commun. ACM 6(9), 555–563 (1963)

    Article  Google Scholar 

  24. Newman, M.: Power laws, Pareto distributions and Zipf’s law. Contemp. Phys. 46(5), 323–351 (2005)

    Article  Google Scholar 

  25. Sathiyanarayanan, M., Pirozzi, D.: Social network visualization: Does partial edges affect user comprehension? In: International Conference on Communication Systems and Networks, pp. 570–575 (2017)

    Google Scholar 

  26. Schulz, C., Nocaj, A., Görtler, J., Deussen, O., Brandes, U., Weiskopf, D.: Probabilistic graph layout for uncertain network visualization. IEEE Trans. Vis. Comput. Graph. 23(1), 531–540 (2017). http://dblp.uni-trier.de/db/journals/tvcg/tvcg23.html#SchulzNGDBW17

  27. Takac, L., Zabovsky, M.: Radius degree layout—fast and easy graph visualization layout. In: International Conference on Digital Technologies, pp. 338–343. Zilina, Slovakia (2014)

    Google Scholar 

  28. Verma, T., Araújo, N.A.M., Herrmann, H.J.: Revealing the structure of the world airline network. CoRR abs/1404.1368 (2014). http://dblp.uni-trier.de/db/journals/corr/corr1404.html#VermaAH14

  29. Wang, H., Song, M.: Ckmeans. 1d.dp: optimal k-means clustering in one dimension by dynamic programming. R Found. Stat. Comput. 28(17), 29 (2012)

    Google Scholar 

  30. Ware, C., Purchase, H., Colpoys, L., McGill, M.: Cognitive measurements of graph aesthetics. Inf. Vis. 1(2), 103–110 (2002)

    Article  Google Scholar 

  31. Yamada, T., Bork, P.: Evolution of biomolecular networks lessons from metabolic and protein interactions. Nat. Rev. Mol. Cell Biol. 10, 791–803 (2009)

    Article  Google Scholar 

  32. Yu, H., Greenbaum, D., Lu, H.X., Wei Zhu, X., Gerstein, M.: Genomic analysis of essentiality within protein networks. Trends in Genet. TIG 20(6), 227–231 (2004)

    Article  Google Scholar 

  33. Yu, H., Kim, P.M., Sprecher, E., Trifonov, V., Gerstein, M.: The importance of bottlenecks in protein networks: correlation with gene essentiality and expression dynamics. PLoS Comput. Biol. 3(4), e59 (2007)

    Article  MathSciNet  Google Scholar 

  34. Zhang, B., Liu, R., Massey, D., Zhang, L.: Collecting the internet as-level topology. SIGCOMM Comput. Commun. Rev. 35(1), 53–61 (2005). https://doi.org/10.1145/1052812.1052825

Download references

Acknowledgements

This work was supported by the National Science Foundation under Grant Number 1429526 and by the Louisiana Board of Regents Support Fund under contract LEQSF(2019-20)-ENH-DE-22.

Author information

Authors and Affiliations

  1. School of Computing and Informatics, University of Louisiana at Lafayette, Lafayette, LA, 70504, USA

    Prabhakar V. Vemavarapu, Mehmet Engin Tozal & Christoph W. Borst

Authors
  1. Prabhakar V. Vemavarapu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mehmet Engin Tozal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christoph W. Borst
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mehmet Engin Tozal .

Editor information

Editors and Affiliations

  1. University of Nevada Reno, Reno, NV, USA

    George Bebis

  2. Stony Brook University, Stony Brook, NY, USA

    Zhaozheng Yin

  3. Drexel University, Philadelphia, PA, USA

    Edward Kim

  4. RWTH Aachen University, Aachen, Germany

    Jan Bender

  5. University of Edinburgh, Edinburgh, UK

    Kartic Subr

  6. IBM Research – Cambridge, Cambridge, MA, USA

    Bum Chul Kwon

  7. University of Waterloo, Waterloo, ON, Canada

    Jian Zhao

  8. Graz University of Technology, Graz, Austria

    Denis Kalkofen

  9. The Hong Kong Polytechnic University, Hong Kong, Hong Kong

    George Baciu

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Vemavarapu, P.V., Tozal, M.E., Borst, C.W. (2020). Near-Optimal Concentric Circles Layout. In: Bebis, G., et al. Advances in Visual Computing. ISVC 2020. Lecture Notes in Computer Science(), vol 12510. Springer, Cham. https://doi.org/10.1007/978-3-030-64559-5_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-64559-5_45

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-64558-8

  • Online ISBN: 978-3-030-64559-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation