{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:39:14Z","timestamp":1742967554731,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319280301"},{"type":"electronic","value":"9783319280318"}],"license":[{"start":{"date-parts":[[2015,12,15]],"date-time":"2015-12-15T00:00:00Z","timestamp":1450137600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-28031-8_18","type":"book-chapter","created":{"date-parts":[[2015,12,13]],"date-time":"2015-12-13T20:02:33Z","timestamp":1450036953000},"page":"209-220","source":"Crossref","is-referenced-by-count":5,"title":["Application of Hexagonal Coordinate Systems for Searching the K-NN in 2D Space"],"prefix":"10.1007","author":[{"given":"Vojt\u011bch","family":"Uher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petr","family":"Gajdo\u0161","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom\u00e1\u0161","family":"Je\u017eowicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V\u00e1clav","family":"Sn\u00e1\u0161el","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,15]]},"reference":[{"key":"18_CR1","unstructured":"Tsaparas, P.: Nearest neighbor search in multidimensional spaces, Technical Report (1999)"},{"key":"18_CR2","unstructured":"Berg, M.D., Cheong, O., Kreveld, M.V., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd ed. Santa Clara, CA, USA: Springer TELOS (2008)"},{"issue":"7","key":"18_CR3","doi-asserted-by":"publisher","first-page":"1014","DOI":"10.1109\/TKDE.2009.141","volume":"22","author":"YJ Kim","year":"2010","unstructured":"Kim, Y.J., Patel, J.: Performance comparison of the \n                  \n                    \n                  \n                  $$r^*$$\n                -tree and the quadtree for knn and distance join queries. IEEE Trans. Knowl. Data Eng. 22(7), 1014\u20131027 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"18_CR4","doi-asserted-by":"publisher","first-page":"1823","DOI":"10.1007\/s11042-013-1476-y","volume":"72","author":"M Yin","year":"2014","unstructured":"Yin, M., Li, S.: Fast bvh construction and refit for ray tracing of dynamic scenes. Multimed. Tools Appl. 72(2), 1823\u20131839 (2014)","journal-title":"Multimed. Tools Appl."},{"issue":"4","key":"18_CR5","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1080\/10867651.1997.10487481","volume":"2","author":"V Havran","year":"1998","unstructured":"Havran, V., Kopal, T., Bittner, J., \u017d\u00e1ra, J.: Fast robust bsp tree traversal algorithm for ray tracing. J. Graph. Tools 2(4), 15\u201323 (1998)","journal-title":"J. Graph. Tools"},{"key":"18_CR6","unstructured":"Sample, N., Haines, M., Arnold, M., Purcell, T., Purcell, T.: Optimizing search strategies in k-d trees (2001)"},{"issue":"5","key":"18_CR7","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1016\/j.sigpro.2011.11.027","volume":"92","author":"J Kybic","year":"2012","unstructured":"Kybic, J., Vnu\u010dko, I.: Approximate all nearest neighbor search for high dimensional entropy estimation for image registration. Signal Process. 92(5), 1302\u20131316 (2012)","journal-title":"Signal Process."},{"key":"18_CR8","unstructured":"Lawder, J.: The application of space-filling curves to the storage and retrieval of multi-dimensional data (2000)"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Gajdos, P., Jezowicz, T., Uher, V., Dohnalek, P.: A parallel fruchtermanreingold algorithm optimized for fast visualization of large graphs and swarms of data. Swarm Evolutionary Comput. (2015)","DOI":"10.1016\/j.swevo.2015.07.006"},{"issue":"6","key":"18_CR10","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/j.is.2004.12.001","volume":"31","author":"T Skopal","year":"2006","unstructured":"Skopal, T., Kr\u00e1tk\u00fd, M., Pokorn\u00fd, J., Sn\u00e1\u0161el, V.: A new range query algorithm for universal b-trees. Inf. Syst. 31(6), 489\u2013511 (2006)","journal-title":"Inf. Syst."},{"issue":"4","key":"18_CR11","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/TVCG.2010.9","volume":"16","author":"M Connor","year":"2010","unstructured":"Connor, M., Kumar, P.: Fast construction of k-nearest neighbor graphs for point clouds. IEEE Trans. Vis. Comput. Graph. 16(4), 599\u2013608 (2010)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Uher, V., Gajdos, P., Jezowicz, 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\u2013310, June 2015","DOI":"10.1109\/CYBConf.2015.7175951"},{"key":"18_CR13","unstructured":"Patel, A.J.: Red blob games\u2014hexagonal grids. \n                  http:\/\/www.redblobgames.com\/grids\/hexagons\/\n                  \n                . Accessed Sep 2015"},{"key":"18_CR14","unstructured":"Patel, A.J.: Amit\u2019s thoughts on grids. \n                  http:\/\/www-cs-students.stanford.edu\/amitp\/game-programming\/grids\/\n                  \n                . Accessed Sep 2015"},{"key":"18_CR15","series-title":"ser. Dover Books on Mathematics Series","volume-title":"Tilings and Patterns","author":"B Gr\u00fcnbaum","year":"2013","unstructured":"Gr\u00fcnbaum, B., Shephard, G.: Tilings and Patterns. ser. Dover Books on Mathematics Series. Dover Publications, New York (2013)"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Rahmati, Z., King, V., Whitesides, S.: Kinetic data structures for all nearest neighbors and closest pair in the plane. In: Proceedings of the Twenty-ninth Annual Symposium on Computational Geometry, ser. SoCG \u201913, pp. 137\u2013144. ACM, New York, NY, USA (2013)","DOI":"10.1145\/2462356.2462378"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Wang, D., Xu, L., Peng, J., Robila, S.: Subdividing hexagon-clustered wireless sensor networks for power-efficiency. In: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing, ser. CMC \u201909, vol. 02, pp. 454\u2013458. IEEE Computer Society, Washington, DC, USA (2009)","DOI":"10.1109\/CMC.2009.317"},{"key":"18_CR18","unstructured":"Salzmann, J., Behnke, R., Timmermann, D.: Hex-mascle x2013; hexagon based clustering with self healing abilities. In: Wireless Communications and Networking Conference (WCNC), 2011 IEEE, pp. 528\u2013533, March 2011"},{"key":"18_CR19","unstructured":"Carr, D.B., Littlefield, R.J., Nichloson, W.L.: Scatterplot matrix techniques for large n. In: Proceedings of the Seventeenth Symposium on the Interface of Computer Sciences and Statistics on Computer Science and Statistics, pp. 297\u2013306. Elsevier North-Holland Inc, New York, NY, USA (1986)"},{"issue":"3","key":"18_CR20","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.is.2003.12.002","volume":"30","author":"H-L Chen","year":"2005","unstructured":"Chen, H.-L., Chang, Y.-I.: Neighbor-finding based on space-filling curves. Inf. Syst. 30(3), 205\u2013226 (2005)","journal-title":"Inf. Syst."}],"container-title":["Advances in Intelligent Systems and Computing","Innovations in Bio-Inspired Computing and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-28031-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T18:50:31Z","timestamp":1559328631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-28031-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,15]]},"ISBN":["9783319280301","9783319280318"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-28031-8_18","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015,12,15]]}}}