Skip to main content
SpringerLink
Log in

Searching of Circular Neighborhoods in the Square and Hexagonal Regular Grids

  • Conference paper
  • First Online:
Intelligent Data Analysis and Applications (ECC 2016)

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

  • 885 Accesses

Abstract

The nearest neighbors (NN) algorithm is a traditional algorithm utilized in many research areas like computer graphics, classification and/or machine learning. This paper aims at the fixed-radius nearest neighbors algorithm in 2D space. The neighbors are searched within a circular neighborhood which is positioned in the bounded space. The radius of the circle is known in advance. The uniform grids can be efficiently utilized for a nearest points query acceleration. This paper presents a study comparing the square and the hexagonal uniform grids and their suitability for a circular neighborhood querying. The two algorithms checking the mutual position/intersection of a circle and a square or a hexagon are described. The tests show the supremacy of the hexagonal grid.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

References

  1. Samet, H.: The quadtree and related hierarchical data structures. ACM Comput. Surv. 16(2), 187–260 (1984)

    Article  MathSciNet  Google Scholar 

  2. Bédorf, J., Gaburov, E., Zwart, S.P.: A sparse octree gravitational N-body code that runs entirely on the GPU processor. J. Comput. Phys. 231(7), 2825–2839 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  3. Yin, M., Li, S.: Fast BVH construction and refit for ray tracing of dynamic scenes. Multimedia Tools Appl. 72(2), 1823–1839 (2014)

    Article  Google Scholar 

  4. Franklin, W.R.: Nearest Point Query on 184,088,599 Points in E3 with a Uniform Grid (2006). http://wrfranklin.org/Research/nearpt3/

  5. Uher, V., Gajdoš, P., Ježowicz, T.: Solving nearest neighbors problem on GPU to speed up the Fruchterman-Reingold graph layout algorithm. In: 2015 IEEE 2nd International Conference on Cybernetics (CYBCONF), pp. 305–310. IEEE Press (2015)

    Google Scholar 

  6. Green, S.: Particle simulation using cuda. NVIDIA Whitepaper 6, 121–128 (2010)

    Google Scholar 

  7. Hoetzlein, R.: Fast fixed-radius nearest neighbors: interactive million-particle fluids. In: GPU Technology Conference (GTC) 2014 (2014)

    Google Scholar 

  8. Kalojanov, J., Slusallek, P.: A parallel algorithm for construction of uniform grids. In: 2009 Proceedings of the Conference on High Performance Graphics, HPG 2009, pp. 23–28. ACM, New York (2009)

    Google Scholar 

  9. Uher, V., Gajdoš, P., Ježowicz, T., Snášel, V.: Application of hexagonal coordinate systems for searching the K-NN in 2D space. In: Snášel, V., Abraham, A., Krömer, P., Pant, M., Muda, A.K. (eds.) Innovations in Bio-Inspired Computing and Applications. AISC, vol. 424, pp. 209–220. Springer, Heidelberg (2016)

    Chapter  Google Scholar 

  10. Lester, L.N., Sandor, J.: Computer graphics on a hexagonal grid. Comput. Graph. 8(4), 401–409 (1984)

    Article  Google Scholar 

  11. Haverkort, H.J.: Recursive tilings and space-filling curves with little fragmentation. CoRR abs/1002.1843 (2010)

    Google Scholar 

  12. Ben, J., Tong, X., Chen, R.: A spatial indexing method for the hexagon discrete global grid system. In: 2010 18th International Conference on Geoinformatics, pp. 1–5, June 2010

    Google Scholar 

  13. Ratschek, H., Rokne, J.: Test for intersection between circle and rectangle. Appl. Math. Lett. 6(4), 21–23 (1993)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgment

This work was supported by The Ministry of Education, Youth and Sports from the National Programme of Sustainability (NPU II) project “IT4Innovations excellence in science - LQ1602”. This work was supported by SGS project, VSB-Technical University of Ostrava, under the grants no. SP2016/97 and no. SP2016/68.

Author information

Authors and Affiliations

  1. Department of Computer Science and National Supercomputing Center, VŠB-Technical University of Ostrava, Ostrava, Czech Republic

    Vojtěch Uher, Petr Gajdoš & Václav Snášel

Authors
  1. Vojtěch Uher
    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. Václav Snášel
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vojtěch Uher .

Editor information

Editors and Affiliations

  1. College of Information Science and Engineering, Fujian University of Technology , Fuzhou, Fujian, China

    Jeng-Shyang Pan

  2. Faculty of Electrical Engineering and Computer Science, VŠB-Technical University of Ostrava , Ostrava-Poruba, Moravskoslezsky, Czech Republic

    Václav Snášel

  3. College of Information Science and Engineering, Fujian University of Technology, Fuzhou, China

    Tien-Wen Sung

  4. College of Information Science and Engineering, Fujian University of Technology, Fuzhou, China

    Xiao Dong Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Uher, V., Gajdoš, P., Snášel, V. (2017). Searching of Circular Neighborhoods in the Square and Hexagonal Regular Grids. In: Pan, JS., Snášel, V., Sung, TW., Wang, X. (eds) Intelligent Data Analysis and Applications. ECC 2016. Advances in Intelligent Systems and Computing, vol 535. Springer, Cham. https://doi.org/10.1007/978-3-319-48499-0_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-48499-0_15

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation