Abstract:

Rasterization is often required in many fields, such as geoscience analysis of remote sensing and analysis of spatial decision. Faced with the reality demand of rapid conversion of mass data, the existing serial rasterization algorithms based on the traditional single machine and single process are difficult to meet the requirements. In this paper, on basis of the analysis of the existing rasterization algorithms, the boundary algebra filling method is studied since it is simple, reliable and fast operational. The rasterization parallel algorithm based on boundary algebra filling was designed and implemented by MPI, GDAL and C++. In order to evaluate the parallel efficiency of the algorithm, different scale data were applied in the experiment. Experimental results show that this algorithm is right and improves the calculating efficiency. What’s more, when the data is larger, the advantage of the algorithm is greater.

Key words: rasterization;boundary algebra filling;parallel algorithm