{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:44:57Z","timestamp":1743140697084,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030913861"},{"type":"electronic","value":"9783030913878"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-91387-8_24","type":"book-chapter","created":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T15:05:39Z","timestamp":1637247939000},"page":"375-391","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Clustering Analyses of Two-Dimensional Space-Filling Curves"],"prefix":"10.1007","author":[{"given":"H. K.","family":"Dai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H. C.","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,19]]},"reference":[{"issue":"4","key":"24_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s002240010003","volume":"33","author":"J Alber","year":"2000","unstructured":"Alber, J., Niedermeier, R.: On multi-dimensional curves with Hilbert property. Theory Comput. Syst. 33(4), 295\u2013312 (2000). https:\/\/doi.org\/10.1007\/s002240010003","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"24_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(96)00259-9","volume":"181","author":"T Asano","year":"1997","unstructured":"Asano, T., Ranjan, D., Roos, T., Welzl, E., Widmayer, P.: Space-filling curves and their use in the design of geometric data structures. Theoret. Comput. Sci. 181(1), 3\u201315 (1997)","journal-title":"Theoret. Comput. Sci."},{"key":"24_CR3","series-title":"Texts in Computational Science and Engineering","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31046-1","volume-title":"Space-Filling Curves - An Introduction with Applications in Scientific Computing","author":"M Bader","year":"2013","unstructured":"Bader, M.: Space-Filling Curves - An Introduction with Applications in Scientific Computing. Texts in Computational Science and Engineering, vol. 9. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-31046-1"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Ban, X., Goswami, M., Zeng, W., Gu, X., Gao, J.: Topology dependent space filling curves for sensor networks and applications. In: Proceedings of the IEEE INFOCOM 2013, Turin, Italy, 14\u201319 April 2013, pp. 2166\u20132174. IEEE (2013)","DOI":"10.1109\/INFCOM.2013.6567019"},{"issue":"3","key":"24_CR5","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/502807.502809","volume":"33","author":"C B\u00f6hm","year":"2001","unstructured":"B\u00f6hm, C., Berchtold, S., Keim, D.A.: Searching in high-dimensional spaces \u2013 index structures for improving the performance of multimedia databases. ACM Comput. Surv. 33(3), 322\u2013373 (2001)","journal-title":"ACM Comput. Surv."},{"issue":"3","key":"24_CR6","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."},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Dai, H.K., Su, H.C.: Approximation and analytical studies of inter-clustering performances of space-filling curves. In: Proceedings of the International Conference on Discrete Random Walks (Discrete Mathematics and Theoretical Computer Science, Volume AC (2003)), pp. 53\u201368, September 2003","DOI":"10.46298\/dmtcs.3338"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-540-24587-2_40","volume-title":"Algorithms and Computation","author":"HK Dai","year":"2003","unstructured":"Dai, H.K., Su, H.C.: On the locality properties of space-filling curves. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol. 2906, pp. 385\u2013394. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-24587-2_40"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-319-41168-2_2","volume-title":"Algorithmic Aspects in Information and Management","author":"HK Dai","year":"2016","unstructured":"Dai, H.K., Su, H.C.: Norm-based locality measures of two-dimensional Hilbert curves. In: Dondi, R., Fertin, G., Mauri, G. (eds.) AAIM 2016. LNCS, vol. 9778, pp. 14\u201325. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41168-2_2"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-030-63924-2_10","volume-title":"Future Data and Security Engineering","author":"HK Dai","year":"2020","unstructured":"Dai, H.K., Su, H.C.: On norm-based locality measures of 2-dimensional discrete Hilbert curves. In: Dang, T.K., K\u00fcng, J., Takizawa, M., Chung, T.M. (eds.) FDSE 2020. LNCS, vol. 12466, pp. 169\u2013184. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-63924-2_10"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.entcs.2008.04.058","volume":"212","author":"HK Dai","year":"2008","unstructured":"Dai, H.K., Whang, K.-Y., Su, H.C.: Locality of corner transformation for multidimensional spatial access methods. Electron. Notes Theor. Comput. Sci. 212, 133\u2013148 (2008). Proceedings of the 2008 International Conference on Foundations of Informatics, Computing and Software","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"2","key":"24_CR12","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V Gaede","year":"1998","unstructured":"Gaede, V., G\u00fcnther, O.: Multidimensional access methods. ACM Comput. Surv. 30(2), 170\u2013231 (1998)","journal-title":"ACM Comput. Surv."},{"issue":"5","key":"24_CR13","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1109\/83.499920","volume":"5","author":"C Gotsman","year":"1996","unstructured":"Gotsman, C., Lindenbaum, M.: On the metric properties of discrete space-filling curves. IEEE Trans. Image Process. 5(5), 794\u2013797 (1996)","journal-title":"IEEE Trans. Image Process."},{"issue":"4","key":"24_CR14","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1111\/rssb.12132","volume":"78","author":"Z He","year":"2016","unstructured":"He, Z., Owen, A.B.: Extensible grids: uniform sampling on a space filling curve. J. Roy. Stat. Soc. Ser. B 78(4), 917\u2013931 (2016)","journal-title":"J. Roy. Stat. Soc. Ser. B"},{"issue":"1","key":"24_CR15","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0020-0190(97)00014-8","volume":"62","author":"HV Jagadish","year":"1997","unstructured":"Jagadish, H.V.: Analysis of the Hilbert curve for representing two-dimensional space. Inf. Process. Lett. 62(1), 17\u201322 (1997)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"24_CR16","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1109\/M-PDT.1995.414844","volume":"3","author":"M Kaddoura","year":"1995","unstructured":"Kaddoura, M., Ou, C.-W., Ranka, S.: Partitioning unstructured computational graphs for non-uniform and adaptive environments. IEEE Parallel Distrib. Technol. 3(3), 63\u201369 (1995)","journal-title":"IEEE Parallel Distrib. Technol."},{"issue":"8","key":"24_CR17","first-page":"e0238322","volume":"15","author":"N Kinney","year":"2020","unstructured":"Kinney, N., Hickman, M., Anandakrishnan, R., Garner, H.R.: Crossing complexity of space-filling curves reveals entanglement of S-phase DNA. Public Libr. Sci. One 15(8), e0238322 (2020)","journal-title":"Public Libr. Sci. One"},{"key":"24_CR18","unstructured":"Lawder, J.K.: The application of space-filling curves to the storage and retrieval of multi-dimensional data. Ph.D. thesis, Birkbeck College, University of London, December 1999"},{"issue":"3","key":"24_CR19","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.jss.2004.10.012","volume":"78","author":"M-J Lee","year":"2005","unstructured":"Lee, M.-J., Whang, K.-Y., Han, W.-S., Song, I.-Y.: Adaptive row major order: a new space filling curve for efficient spatial join processing in the transform space. J. Syst. Softw. 78(3), 257\u2013269 (2005)","journal-title":"J. Syst. Softw."},{"key":"24_CR20","series-title":"NATO ASI Series (Series F: Computer and Systems Sciences)","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-642-82456-2_10","volume-title":"Combinatorial Algorithms on Words","author":"A Lempel","year":"1984","unstructured":"Lempel, A., Ziv, J.: Compression of two-dimensional images. In: Apostolico, A., Galil, Z. (eds.) Combinatorial Algorithms on Words. NATO ASI Series (Series F: Computer and Systems Sciences), vol. 12, pp. 141\u2013156. Springer, Heidelberg (1984). https:\/\/doi.org\/10.1007\/978-3-642-82456-2_10"},{"issue":"4","key":"24_CR21","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1137\/0607063","volume":"7","author":"G Mitchison","year":"1986","unstructured":"Mitchison, G., Durbin, R.: Optimal numberings of an $${N} \\times {N}$$ array. SIAM J. Algebraic Discrete Methods 7(4), 571\u2013582 (1986)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"1","key":"24_CR22","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/69.908985","volume":"13","author":"B Moon","year":"2001","unstructured":"Moon, B., Jagadish, H.V., Faloutsos, C., Saltz, J.H.: Analysis of the clustering properties of the Hilbert space-filling curve. IEEE Trans. Knowl. Data Eng. 13(1), 124\u2013141 (2001)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"24_CR23","doi-asserted-by":"crossref","unstructured":"P\u00e9rez, A., Kamata, S., Kawaguchi, E.: Peano scanning of arbitrary size images. In: Proceedings of the International Conference on Pattern Recognition, pp. 565\u2013568. IEEE Computer Society (1992)","DOI":"10.1109\/ICPR.1992.202050"},{"issue":"4","key":"24_CR24","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1145\/76359.76361","volume":"36","author":"LK Platzman","year":"1989","unstructured":"Platzman, L.K., Bartholdi, J.J., III.: Spacefilling curves and the planar travelling salesman problem. J. ACM 36(4), 719\u2013737 (1989)","journal-title":"J. ACM"},{"key":"24_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0871-6","volume-title":"Space-Filling Curves","author":"H Sagan","year":"1994","unstructured":"Sagan, H.: Space-Filling Curves. Springer, New York (1994). https:\/\/doi.org\/10.1007\/978-1-4612-0871-6"},{"issue":"7","key":"24_CR26","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/S0950-5849(02)00026-5","volume":"44","author":"J-W Song","year":"2002","unstructured":"Song, J.-W., Whang, K.-Y., Lee, Y.-K., Lee, M.-J., Han, W.-S., Park, B.-K.: The clustering property of corner transformation for spatial database applications. Inf. Soft. Technol. 44(7), 419\u2013429 (2002)","journal-title":"Inf. Soft. Technol."},{"issue":"4","key":"24_CR27","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1109\/69.790844","volume":"11","author":"J-W Song","year":"1999","unstructured":"Song, J.-W., Whang, K.-Y., Lee, Y.-K., Lee, M.-J., Kim, S.-W.: Spatial join processing using corner transformation. IEEE Trans. Knowl. Data Eng. 11(4), 688\u2013695 (1999)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3","key":"24_CR28","first-page":"22:1","volume":"12","author":"C Wang","year":"2016","unstructured":"Wang, C., Jiang, H., Dong, Y.: Connectivity-based space filling curve construction algorithms in high genus 3D surface WSNs. ACM Trans. Sens. Netw. 12(3), 22:1-22:29 (2016)","journal-title":"ACM Trans. Sens. Netw."},{"key":"24_CR29","doi-asserted-by":"crossref","unstructured":"Xu, P., Tirthapura, S.: On the optimality of clustering through a space filling curve. In: PODS 2012 Proceedings of the 31st Symposium on Principles of Database Systems, pp. 215\u2013224, May 2012","DOI":"10.1145\/2213556.2213587"}],"container-title":["Lecture Notes in Computer Science","Future Data and Security Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91387-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T15:28:53Z","timestamp":1726154933000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91387-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030913861","9783030913878"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91387-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"19 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FDSE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Future Data and Security Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fdse2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/thefdse.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"168","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"52","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}