A Universal Generating Algorithm of the Polyhedral Discrete Grid Based on Unit Duplication

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 “simple unit replication + effective region restriction”. 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.

[1]  K. Sahr,et al.  Geodesic Discrete Global Grid Systems , 2003 .

[2]  Ali Mahdavi-Amiri,et al.  Categorization and Conversions for Indexing Methods of Discrete Global Grid Systems , 2015, ISPRS Int. J. Geo Inf..

[3]  B. P. Acharya,et al.  Approximate evaluation of multiple complex integrals of analytic functions , 1983, Computing.

[4]  A. Vince,et al.  Indexing the aperture 3 hexagonal discrete global grid , 2006, J. Vis. Commun. Image Represent..

[5]  Marinos Kavouras,et al.  On the Determination of the Optimum Path in Space , 1995, COSIT.

[6]  A-Xing Zhu,et al.  A discrete global grid system for earth system modeling , 2018, Int. J. Geogr. Inf. Sci..

[7]  Christophe Claramunt,et al.  A bidirectional path-finding algorithm and data structure for maritime routing , 2014, International Journal of Geographical Information Science.

[8]  Mir Abolfazl Mostafavi,et al.  A global kinetic spatial data structure for a marine simulation , 2004, Int. J. Geogr. Inf. Sci..

[9]  Kevin Sahr,et al.  Planar and spherical hierarchical, multi-resolution cellular automata , 2008, Comput. Environ. Urban Syst..

[10]  Denis White,et al.  Global Grids from Recursive Diamond Subdivisions of the Surface of an Octahedron or Icosahedron , 2000 .

[11]  Todd D. Ringler,et al.  Climate modeling with spherical geodesic grids , 2002, Comput. Sci. Eng..

[12]  John J. Bartholdi,et al.  Continuous indexing of hierarchical subdivisions of the globe , 2001, Int. J. Geogr. Inf. Sci..

[13]  Geoffrey Dutton.  Part 4: Mathematical, Algorithmic and Data Structure Issues: Geodesic Modelling Of Planetary Relief , 1984 .

[14]  Hanan Samet,et al.  Navigating through triangle meshes implemented as linear quadtrees , 2000, TOGS.

[15]  Michael F. Goodchild,et al.  A hierarchical spatial data structure for global geographic information systems , 1992, CVGIP Graph. Model. Image Process..

[16]  Xiaochong Tong,et al.  Modeling and Expression of Vector Data in the Hexagonal Discrete Global Grid System , 2013 .

[17]  Patrik Ottoson,et al.  Ellipsoidal quadtrees for indexing of global geographical data , 2002, Int. J. Geogr. Inf. Sci..