Abstract

Abstract. Discrete Global Grids System (DGGS) is a kind of digital multi-resolution earth reference model, in terms of structure, it is conducive to the geographical spatial big data integration and mining. Vector is one of the important types of spatial data, only by discretization, can it be applied in grids system to make process and analysis. Based on the some constraint conditions, this paper put forward a strict definition of discrete lines, building a mathematic model of the discrete lines by base vectors combination method. Transforming mesh discrete lines issue in n-dimensional grids into the issue of optimal deviated path in n-minus-one dimension using hyperplane, which, therefore realizing dimension reduction process in the expression of mesh discrete lines. On this basis, we designed a simple and efficient algorithm for dimension reduction and generation of the discrete lines. The experimental results show that our algorithm not only can be applied in the two-dimensional rectangular grid, also can be applied in the two-dimensional hexagonal grid and the three-dimensional cubic grid. Meanwhile, when our algorithm is applied in two-dimensional rectangular grid, it can get a discrete line which is more similar to the line in the Euclidean space.

Highlights

  • Discrete Global Grid System (DGGS) is a kind of multiresolution hierarchy structure, which can take a particular approach to subdivide infinitely and it takes data manipulation by using code instead of traditional coordinate

  • The basic principle of vector data expression in grid is that the expression of a vector in the grid is as close to its shape in the Euclidean space as possible to ensure data characteristics

  • For this reason, the discrete grid line generated by the dimension reduction algorithm has the following advantages over the result of Bresenham algorithm: (1)The vector line is closer to the central axis of the discrete grid line, this means that the generated discrete grid line is closer to the expression of the vector line in the European space; (2)The continuity of generated discrete grid line is better, all adjacent grid units exist in adjacent edge forms; (3)The display of the corners is more detailed; 4.3

Read more

Summary

INTRODUCTION

Discrete Global Grid System (DGGS) is a kind of multiresolution hierarchy structure, which can take a particular approach to subdivide infinitely and it takes data manipulation by using code instead of traditional coordinate. Vector data grid expressions are widely used in the spatial topology analysis and grid index, regarded as one of the key issues in the discrete global grid study Their core is the expression of the points, the lines and the surfaces in the grid. In this paper, we use the method of vector basis linear combination to establish the strict mathematical model of the discrete line, and turn it into the optimal deviation path problem. According to this thought, we design the generation algorithm. Experimental results show that the new algorithm is effective and has certain advantages in the accuracy of expression

The Constraints Of Grid Discrete Lines
Vector Expression Of The Discrete Line
The Basic Thought Of Dimension Reduction Algorithm
Determine The Optimal Vector Basis
Generation Algorithm
TEST AND RESULT ANALYSIS
CONCLUSION
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call