A Universal Generating Algorithm of the Polyhedral Discrete Grid Based on Unit Duplication
2019
Li Meng | Xiaochong Tong | Shuaibo Fan | Chengqi Cheng | Bo Chen | Weiming Yang | Kaihua Hou
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 &ldquo:simple unit replication + effective region restriction&rdquo:. 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.
Показать больше [+] Меньше [-]Библиографическая информация
Эту запись предоставил Multidisciplinary Digital Publishing Institute