Efficient Calculation of Distance Transform on Discrete Global Grid Systems

Geospatial data analysis often requires the computing of a distance transform for a given vector feature. For instance, in wildfire management, it is helpful to find the distance of all points in an area from the wildfire's boundary. Computing a distance transform on traditional Geographic Information Systems (GIS) is usually adopted from image processing methods, albeit prone to distortion resulting from flat maps. Discrete Global Grid Systems (DGGS) are relatively new low-distortion globe-based GIS that discretize the Earth into highly regular cells using multiresolution grids. In this paper, we introduce an efficient distance transform algorithm for DGGS. Our novel algorithm heavily exploits the hierarchy of a DGGS and its mathematical properties and applies to many different DGGSs. We evaluate our method by comparing its speed and distortion with the distance transform methods used in traditional GIS and general 3D meshes. We demonstrate that our method is efficient and has minimal distortion.

Automated summary

This paper presents an efficient distance transform algorithm for Discrete Global Grid Systems (DGGS), which takes advantage of the hierarchy and mathematical properties of DGGS and is applicable to various DGGSs. By comparing its speed and distortion with traditional GIS and general 3D meshes, we demonstrate that our method is efficient and has minimal distortion.