A New Iterative Approach for Finding Nearest Neighbors Using Space-Filling Curves for Fast Graphs Visualization | SpringerLink
Skip to main content
Springer Nature Link
Log in

A New Iterative Approach for Finding Nearest Neighbors Using Space-Filling Curves for Fast Graphs Visualization

  • Conference paper
International Joint Conference SOCO’14-CISIS’14-ICEUTE’14

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 299))

Abstract

Graphs in the computer science are widely used in social network analysis, computer networks, transportation networks, and many other areas. In general, they can visualize relationships between objects. However, fast drawing of graphs with readable layouts is still a challenge. This paper aims to the speed up the original Fruchterman-Reingold graph layout algorithm by computing repulsive forces only between vertices that are near each other. A new approach based on the selected space-filling curves is described.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 22879
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 28599
Price includes VAT (Japan)
  • 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Batagelj, V., Mrvar, A.: Pajek-program for large network analysis. Connections 21(2), 47–57 (1998)

    Google Scholar 

  2. Breinholt, G., Schierz, C.: Algorithm 781: Generating hilbert’s space-filling curve by recursion. ACM Trans. Math. Softw. 24(2), 184–189 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  3. Butz, A.R.: Convergence with hilbert’s space filling curve. J. Comput. Syst. Sci. 3(2), 128–146 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  4. Connor, M., Kumar, P.: Fast construction of k-nearest neighbor graphs for point clouds. IEEE Transactions on Visualization and Computer Graphics 16(4), 599–608 (2010)

    Article  Google Scholar 

  5. Corchado, E., Baruque, B.: Wevos-visom: An ensemble summarization algorithm for enhanced data visualization. Neurocomputing 75(1), 171–184 (2012)

    Article  Google Scholar 

  6. Corchado, E., Wozniak, M., Abraham, A., de Carvalho, A.C.P.L.F., Snásel, V.: Recent trends in intelligent data analysis. Neurocomputing 126, 1–2 (2014)

    Article  Google Scholar 

  7. Frishman, Y., Tal, A.: Multi-level graph layout on the gpu. IEEE Transactions on Visualization and Computer Graphics 13(6), 1310–1319 (2007)

    Article  Google Scholar 

  8. Fruchterman, T.M., Reingold, E.M.: Graph drawing by force-directed placement. Software: Practice and Experience 21(11), 1129–1164 (1991)

    Google Scholar 

  9. Godiyal, A., Hoberock, J., Garland, M., Hart, J.C.: Rapid multipole graph drawing on the GPU. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 90–101. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  10. Hartmann, K., Götzelmann, T., Ali, K., Strothotte, T.: Metrics for functional and aesthetic label layouts. In: Butz, A., Fisher, B., Krüger, A., Olivier, P. (eds.) SG 2005. LNCS, vol. 3638, pp. 115–126. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  11. Jezowicz, T., Kudelka, M., Platos, J., Snásel, V.: Visualization of large graphs using gpu computing. In: INCoS, pp. 662–667 (2013)

    Google Scholar 

  12. Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Information Processing Letters 31(1), 7–15 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  13. Kybic, J., Vnucko, I.: Approximate all nearest neighbor search for high dimensional entropy estimation for image registration. Signal Processing 92(5), 1302–1316 (2012)

    Article  Google Scholar 

  14. Lam, W.M., Shapiro, J.M.: A class of fast algorithms for the peano-hilbert space-filling curve. In: ICIP (1), pp. 638–641 (1994)

    Google Scholar 

  15. Liao, S., Lopez, M.A., Leutenegger, S.T.: High dimensional similarity search with space filling curves. In: Proceedings of the 17th International Conference on Data Engineering, pp. 615–622. IEEE (2001)

    Google Scholar 

  16. Muelder, C., Ma, K.-L.: Rapid graph layout using space filling curves. IEEE Transactions on Visualization and Computer Graphics 14(6), 1301–1308 (2008)

    Article  Google Scholar 

  17. Novosad, T., Snásel, V., Abraham, A., Yang, J.Y.: Prosima: Protein similarity algorithm. In: NaBIC, pp. 84–91 (2009)

    Google Scholar 

  18. Purchase, H.: Which aesthetic has the greatest effect on human understanding. In: DiBattista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 248–261. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, FEECS, VŠB - Technical University of Ostrava, 17. listopadu 15, 708 33, Ostrava-Poruba, Czech Republic

    Tomáš Ježowicz, Petr Gajdoš, Eliška Ochodková & Václav Snášel

Authors
  1. Tomáš Ježowicz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Petr Gajdoš
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Eliška Ochodková
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Václav Snášel
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tomáš Ježowicz .

Editor information

Editors and Affiliations

  1. DeustoTech Computing, University of Deusto, Bilbao, Spain

    José Gaviria de la Puerta

  2. DeustoTech Computing, University of Deusto, Bilbao, Spain

    Iván García Ferreira

  3. DeustoTech Computing, University of Deusto, Bilbao, Spain

    Pablo Garcia Bringas

  4. German Workforce ADL Partnership Laboratory, Waltershausen, Germany

    Fanny Klett

  5. Scientific Network for Innovation and Research Excellence, Machine Intelligence Research Labs (MIR Labs), Washington, USA

    Ajith Abraham

  6. Department of Computer Science, University of Sao Paulo at Sao Carlos, Sao Carlos, Brazil

    André C.P.L.F. de Carvalho

  7. Department of Civil Engineering Escuela Politénica Superior, University of Burgos, Burgos, Spain

    Álvaro Herrero

  8. Department of Civil Engineering Escuela Politénica Superior, University of Burgos, Burgos, Spain

    Bruno Baruque

  9. Departamento de Enxeñeria Industrial, Escuela Universitaria Politécnica, University of Salamanca, Salamanca, Spain and University of Coruña, La Coruña, Spain

    Héctor Quintián

  10. University of Salamanca, Salamanca, Spain

    Emilio Corchado

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Ježowicz, T., Gajdoš, P., Ochodková, E., Snášel, V. (2014). A New Iterative Approach for Finding Nearest Neighbors Using Space-Filling Curves for Fast Graphs Visualization. In: de la Puerta, J., et al. International Joint Conference SOCO’14-CISIS’14-ICEUTE’14. Advances in Intelligent Systems and Computing, vol 299. Springer, Cham. https://doi.org/10.1007/978-3-319-07995-0_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07995-0_2

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07994-3

  • Online ISBN: 978-3-319-07995-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics