{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:31:25Z","timestamp":1761895885219,"version":"3.40.4"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319079943"},{"type":"electronic","value":"9783319079950"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07995-0_2","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T23:24:31Z","timestamp":1402442671000},"page":"11-20","source":"Crossref","is-referenced-by-count":3,"title":["A New Iterative Approach for Finding Nearest Neighbors Using Space-Filling Curves for Fast Graphs Visualization"],"prefix":"10.1007","author":[{"given":"Tom\u00e1\u0161","family":"Je\u017eowicz","sequence":"first","affiliation":[]},{"given":"Petr","family":"Gajdo\u0161","sequence":"additional","affiliation":[]},{"given":"Eli\u0161ka","family":"Ochodkov\u00e1","sequence":"additional","affiliation":[]},{"given":"V\u00e1clav","family":"Sn\u00e1\u0161el","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"2_CR1","first-page":"47","volume":"21","author":"V. Batagelj","year":"1998","unstructured":"Batagelj, V., Mrvar, A.: Pajek-program for large network analysis. Connections\u00a021(2), 47\u201357 (1998)","journal-title":"Connections"},{"issue":"2","key":"2_CR2","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1145\/290200.290219","volume":"24","author":"G. Breinholt","year":"1998","unstructured":"Breinholt, G., Schierz, C.: Algorithm 781: Generating hilbert\u2019s space-filling curve by recursion. ACM Trans. Math. Softw.\u00a024(2), 184\u2013189 (1998)","journal-title":"ACM Trans. Math. Softw."},{"issue":"2","key":"2_CR3","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/S0022-0000(69)80010-3","volume":"3","author":"A.R. Butz","year":"1969","unstructured":"Butz, A.R.: Convergence with hilbert\u2019s space filling curve. J. Comput. Syst. Sci.\u00a03(2), 128\u2013146 (1969)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"2_CR4","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 Transactions on Visualization and Computer Graphics\u00a016(4), 599\u2013608 (2010)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"issue":"1","key":"2_CR5","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.neucom.2011.01.027","volume":"75","author":"E. Corchado","year":"2012","unstructured":"Corchado, E., Baruque, B.: Wevos-visom: An ensemble summarization algorithm for enhanced data visualization. Neurocomputing\u00a075(1), 171\u2013184 (2012)","journal-title":"Neurocomputing"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.neucom.2013.07.001","volume":"126","author":"E. Corchado","year":"2014","unstructured":"Corchado, E., Wozniak, M., Abraham, A., de Carvalho, A.C.P.L.F., Sn\u00e1sel, V.: Recent trends in intelligent data analysis. Neurocomputing\u00a0126, 1\u20132 (2014)","journal-title":"Neurocomputing"},{"issue":"6","key":"2_CR7","doi-asserted-by":"publisher","first-page":"1310","DOI":"10.1109\/TVCG.2007.70580","volume":"13","author":"Y. Frishman","year":"2007","unstructured":"Frishman, Y., Tal, A.: Multi-level graph layout on the gpu. IEEE Transactions on Visualization and Computer Graphics\u00a013(6), 1310\u20131319 (2007)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"issue":"11","key":"2_CR8","first-page":"1129","volume":"21","author":"T.M. Fruchterman","year":"1991","unstructured":"Fruchterman, T.M., Reingold, E.M.: Graph drawing by force-directed placement. Software: Practice and Experience\u00a021(11), 1129\u20131164 (1991)","journal-title":"Software: Practice and Experience"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-00219-9_10","volume-title":"Graph Drawing","author":"A. Godiyal","year":"2009","unstructured":"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.\u00a05417, pp. 90\u2013101. Springer, Heidelberg (2009)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/11536482_10","volume-title":"Smart Graphics","author":"K. Hartmann","year":"2005","unstructured":"Hartmann, K., G\u00f6tzelmann, T., Ali, K., Strothotte, T.: Metrics for functional and aesthetic label layouts. In: Butz, A., Fisher, B., Kr\u00fcger, A., Olivier, P. (eds.) SG 2005. LNCS, vol.\u00a03638, pp. 115\u2013126. Springer, Heidelberg (2005)"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Jezowicz, T., Kudelka, M., Platos, J., Sn\u00e1sel, V.: Visualization of large graphs using gpu computing. In: INCoS, pp. 662\u2013667 (2013)","DOI":"10.1109\/INCoS.2013.126"},{"issue":"1","key":"2_CR12","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","volume":"31","author":"T. Kamada","year":"1989","unstructured":"Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Information Processing Letters\u00a031(1), 7\u201315 (1989)","journal-title":"Information Processing Letters"},{"issue":"5","key":"2_CR13","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., Vnucko, I.: Approximate all nearest neighbor search for high dimensional entropy estimation for image registration. Signal Processing\u00a092(5), 1302\u20131316 (2012)","journal-title":"Signal Processing"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Lam, W.M., Shapiro, J.M.: A class of fast algorithms for the peano-hilbert space-filling curve. In: ICIP (1), pp. 638\u2013641 (1994)","DOI":"10.1109\/ICIP.1994.413392"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"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\u2013622. IEEE (2001)","DOI":"10.1109\/ICDE.2001.914876"},{"issue":"6","key":"2_CR16","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1109\/TVCG.2008.158","volume":"14","author":"C. Muelder","year":"2008","unstructured":"Muelder, C., Ma, K.-L.: Rapid graph layout using space filling curves. IEEE Transactions on Visualization and Computer Graphics\u00a014(6), 1301\u20131308 (2008)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Novosad, T., Sn\u00e1sel, V., Abraham, A., Yang, J.Y.: Prosima: Protein similarity algorithm. In: NaBIC, pp. 84\u201391 (2009)","DOI":"10.1109\/NABIC.2009.5393605"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/3-540-63938-1_67","volume-title":"Graph Drawing","author":"H. Purchase","year":"1997","unstructured":"Purchase, H.: Which aesthetic has the greatest effect on human understanding. In: DiBattista, G. (ed.) GD 1997. LNCS, vol.\u00a01353, pp. 248\u2013261. Springer, Heidelberg (1997)"}],"container-title":["Advances in Intelligent Systems and Computing","International Joint Conference SOCO\u201914-CISIS\u201914-ICEUTE\u201914"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07995-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:15:51Z","timestamp":1746263751000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-07995-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319079943","9783319079950"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07995-0_2","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2014]]}}}