{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T23:59:36Z","timestamp":1772755176206,"version":"3.50.1"},"reference-count":28,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T00:00:00Z","timestamp":1552953600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Key Research and Development Plan","award":["2018YFB0505300"],"award-info":[{"award-number":["2018YFB0505300"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["41671409"],"award-info":[{"award-number":["41671409"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJGI"],"abstract":"<jats:p>Based on the analysis of the problems in the generation algorithm of discrete grid systems domestically and abroad, a new universal algorithm for the unit duplication of a polyhedral discrete grid is proposed, and its core is \u201csimple unit replication + effective region restriction\u201d. First, the grid coordinate system and the corresponding spatial rectangular coordinate system are established to determine the rectangular coordinates of any grid cell node. Then, the type of the subdivision grid system to be calculated is determined to identify the three key factors affecting the grid types, which are the position of the starting point, the length of the starting edge, and the direction of the starting edge. On this basis, the effective boundary of a multiscale grid can be determined and the grid coordinates of a multiscale grid can be obtained. A one-to-one correspondence between the multiscale grids and subdivision types can be established. Through the appropriate rotation, translation and scaling of the multiscale grid, the node coordinates of a single triangular grid system are calculated, and the relationships between the nodes of different levels are established. Finally, this paper takes a hexagonal grid as an example to carry out the experiment verifications by converting a single triangular grid system (plane) directly to a single triangular grid with a positive icosahedral surface to generate a positive icosahedral surface grid. The experimental results show that the algorithm has good universality and can generate the multiscale grid of an arbitrary grid configuration by adjusting the corresponding starting transformation parameters.<\/jats:p>","DOI":"10.3390\/ijgi8030146","type":"journal-article","created":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T12:12:25Z","timestamp":1552997545000},"page":"146","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Universal Generating Algorithm of the Polyhedral Discrete Grid Based on Unit Duplication"],"prefix":"10.3390","volume":"8","author":[{"given":"Li","family":"Meng","sequence":"first","affiliation":[{"name":"Institute of Remote Sensing and GIS, Peking University, Beijing 100871, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9754-1502","authenticated-orcid":false,"given":"Xiaochong","family":"Tong","sequence":"additional","affiliation":[{"name":"Information Engineering University, Zhengzhou 450001, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuaibo","family":"Fan","sequence":"additional","affiliation":[{"name":"Information Engineering University, Zhengzhou 450001, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengqi","family":"Cheng","sequence":"additional","affiliation":[{"name":"College of Engineering, Peking University, Beijing 100871, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Chen","sequence":"additional","affiliation":[{"name":"College of Engineering, Peking University, Beijing 100871, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weiming","family":"Yang","sequence":"additional","affiliation":[{"name":"Logistics Science Research Institute, Beijing 100166, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaihua","family":"Hou","sequence":"additional","affiliation":[{"name":"College of Engineering, Peking University, Beijing 100871, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,3,19]]},"reference":[{"key":"ref_1","unstructured":"Zhang, Y., and Benjin, T.X. (2007). Spherical Discrete Grid of Geospatial Information: Theory, Algorithms and Applications, Science Press."},{"key":"ref_2","first-page":"110","article-title":"Spatial information processing method based on spherical hexagonal grid system","volume":"23","author":"Zhang","year":"2006","journal-title":"J. Surv. Mapp. Sci. Technol."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"188","DOI":"10.3138\/R613-191U-7255-082N","article-title":"Geodesic modelling of planetary relief","volume":"21","author":"Dutton","year":"1984","journal-title":"Cartographica"},{"key":"ref_4","unstructured":"Dutton, G. (1989). Modeling locational uncertainty via hierarchical tessellation. Accuracy of Spatial Database, Tayor and Francis."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/1049-9652(92)90032-S","article-title":"A hierarchical spatial data structure for global geographic information systems","volume":"54","author":"Goodchild","year":"1992","journal-title":"Graph. Models Image Process."},{"key":"ref_6","unstructured":"Szalay, A.S., Gray, J., Fekete, G., Kunszt, P.Z., Kukol, P., and Thakar, A. (2005). Indexing the Sphere with the Hierarchical Triangular Mesh, Microsoft Research. Technical Report."},{"key":"ref_7","unstructured":"Alborzi, H., and Samet, H. (2000, January 26\u201328). Augmenting SAND with a spherical data model. Proceedings of the International Conference on Discrete Global Grids, Santa Barbara, CA, USA."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1023\/A:1006407023786","article-title":"Global grids from recursive diamond subdivisions of the surface of an octahedron or icosahedron","volume":"64","author":"White","year":"2000","journal-title":"Environ. Monit. Assess."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1559\/152304003100011090","article-title":"Geodesic Discrete Global Grid Systems","volume":"30","author":"Sahr","year":"2003","journal-title":"Cartogr. Geogr. Inf. Sci."},{"key":"ref_10","unstructured":"Peterson, P. (2011). Closed-Packed Uniformly Adjacent, Multi-Resolutional Overlapping Spatial Data Ordering. (#0,8018,458), U.S. Patent."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1227","DOI":"10.1016\/j.jvcir.2006.04.003","article-title":"Indexing the aperture 3 hexagonal discrete global grid","volume":"17","author":"Vince","year":"2006","journal-title":"J. Vis. Commun. Image Represent."},{"key":"ref_12","unstructured":"Zheng, X. (2007). Efficient Fourier Transforms on Hexagonal Arrays, University of Florida."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"15","DOI":"10.5194\/isprsarchives-XL-4-W2-15-2013","article-title":"Modeling and Expression of Vector Data in the Hexagonal Discrete Global Grid System","volume":"XL-4\/W2","author":"Tong","year":"2013","journal-title":"Int. Arch. Photogramm. Remote Sens. Spat. Inf. Sci."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1080\/13658816.2017.1391389","article-title":"A discrete global grid system for earth system modeling","volume":"32","author":"Lin","year":"2018","journal-title":"Int. J. Geogr. Inf. Sci."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1080\/13658810310001620942","article-title":"A global kinetic spatial data structure for a marine simulation","volume":"18","author":"Mostafavi","year":"2004","journal-title":"Int. J. Geogr. Inf. Sci."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1080\/13658810110095075","article-title":"Ellipsoidal quadtrees for indexing of global geographical data","volume":"16","author":"Ottoson","year":"2002","journal-title":"Int. J. Geogr. Inf. Sci."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1080\/13658810110043603","article-title":"Continuous indexing of hierarchical subdivisions of the globe","volume":"15","author":"Bartholdi","year":"2001","journal-title":"Int. J. Geogr. Inf. Sci."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"320","DOI":"10.3390\/ijgi4010320","article-title":"Categorization and Conversions for Indexing Methods of Discrete Global Grid Systems","volume":"4","author":"Amiri","year":"2015","journal-title":"ISPRS Int. J. Geo-Inf."},{"key":"ref_19","first-page":"279","article-title":"Application of global grids in environmental sampling","volume":"30","author":"Olsen","year":"1998","journal-title":"Computing"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/MCISE.2002.1032427","article-title":"Climate modeling with spherical geodesic grids","volume":"4","author":"Randall","year":"2002","journal-title":"Comput. Sci. Eng."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1145\/343593.343598","article-title":"Navigating through triangle meshes implemented as linear quadtrees","volume":"19","author":"Lee","year":"2000","journal-title":"ACM Trans. Graph."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1355","DOI":"10.1080\/13658816.2014.887087","article-title":"A bidirectional path-finding algorithm and data structure for maritime routing","volume":"28","author":"Tsatcha","year":"2014","journal-title":"Int. J. Geogr. Inf. Sci."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Stefanakis, E., and Kavouras, M. (1995). On the determination of the optimum path in space. Genesis.","DOI":"10.1007\/3-540-60392-1_16"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/j.compenvurbsys.2008.03.001","article-title":"Planar and spherical hierarchical, multi-resolution cellular automata","volume":"32","author":"Kiester","year":"2008","journal-title":"Comput. Environ. Urban Syst."},{"key":"ref_25","first-page":"29","article-title":"Modeling methods and basic problems of global discrete grid","volume":"28","author":"Zhao","year":"2012","journal-title":"Geogr. Geogr. Inf. Sci."},{"key":"ref_26","first-page":"112","article-title":"An improved approximate equal-area QTM partition model","volume":"45","author":"Zhao","year":"2016","journal-title":"J. Surv. Mapp."},{"key":"ref_27","first-page":"397","article-title":"Global discrete grid hierarchical modeling based on diamond block","volume":"36","author":"Zhao","year":"2007","journal-title":"J. Chin. Univ. Min. Technol."},{"key":"ref_28","first-page":"789","article-title":"Hexagonal discrete grid system generation algorithm for octahedron","volume":"17","author":"Ben","year":"2015","journal-title":"J. Geo-Inf. Sci."}],"container-title":["ISPRS International Journal of Geo-Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2220-9964\/8\/3\/146\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T12:39:03Z","timestamp":1760186343000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2220-9964\/8\/3\/146"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,19]]},"references-count":28,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2019,3]]}},"alternative-id":["ijgi8030146"],"URL":"https:\/\/doi.org\/10.3390\/ijgi8030146","relation":{},"ISSN":["2220-9964"],"issn-type":[{"value":"2220-9964","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3,19]]}}}