{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:19:15Z","timestamp":1740169155510,"version":"3.37.3"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["41401465"],"award-info":[{"award-number":["41401465"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["41371384"],"award-info":[{"award-number":["41371384"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2979250","type":"journal-article","created":{"date-parts":[[2020,3,10]],"date-time":"2020-03-10T05:26:44Z","timestamp":1583818004000},"page":"47580-47595","source":"Crossref","is-referenced-by-count":1,"title":["MI-HCS: Monotonically Increasing Hilbert Code Segments for 3D Geospatial Query Window"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6142-8172","authenticated-orcid":false,"given":"Yuhao","family":"Wu","sequence":"first","affiliation":[{"name":"Institute of Geospatial Information, Information Engineering University, Zhengzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0529-3538","authenticated-orcid":false,"given":"Xuefeng","family":"Cao","sequence":"additional","affiliation":[{"name":"Institute of Geospatial Information, Information Engineering University, Zhengzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1376-6892","authenticated-orcid":false,"given":"Wanzhong","family":"Sun","sequence":"additional","affiliation":[{"name":"Institute of Geospatial Information, Information Engineering University, Zhengzhou, China"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4379(97)00002-1"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0255(94)00107-M"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.5194\/isprs-archives-XLII-4-417-2018"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cag.2015.01.007"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-010-9306-3"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.jvcir.2011.12.005"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/373626.373678"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45033-5_3"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"2109","DOI":"10.1109\/83.887978","article-title":"Space-filling approach for fast window query on compressed images","volume":"9","author":"hu","year":"2000","journal-title":"IEEE Trans Image Process"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/BF01210594"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1080\/136588198241897"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/69.599927"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1023\/A:1025196714293"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/69.908985"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(97)00014-8"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/3PGCIC.2014.96"},{"key":"ref7","article-title":"Foundations of multidimensional and metric data structures","author":"samet","year":"2005","journal-title":"Computer Graphics and Geometric Modeling"},{"key":"ref2","first-page":"465","article-title":"An Algorithm for hilbert ordering code based on spatial hierarchical decomposition","volume":"6","author":"lu","year":"2001","journal-title":"J Image Graph"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1108\/EC-07-2015-0203"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1080\/02693799008941526"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/IITA.2008.256"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1049\/iet-ipr.2008.0155"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2006.12.003"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/83.623197"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.3390\/ijgi7080327"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/1045-926X(92)90007-9"},{"article-title":"Dynamic octree load balancing using space-filling curves","year":"2003","author":"campbell","key":"ref25"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09027910.pdf?arnumber=9027910","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T19:43:17Z","timestamp":1662666197000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9027910\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2979250","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}