Parallel scanline algorithm for rapid rasterization of vector geographic data

With the expansion of complex geographic calculations and the increase of spatial data types involved in the spatial analysis of large areas, the need becomes urgent for fast rasterization of massive multi-source geographic vector data. A parallel scanline algorithm is proposed for rapid rasterizati...

Full description

Saved in:
Bibliographic Details
Published in:Computers & geosciences 2013-09, Vol.59, p.31-40
Main Authors: Wang, Yafei, Chen, Zhenjie, Cheng, Liang, Li, Manchun, Wang, Jiechen
Format: Article
Language:English
Subjects:
algorithms
computers
Parallel processing
Rasterization
Scanline
Speedup
vector data
Vector geographic data
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:With the expansion of complex geographic calculations and the increase of spatial data types involved in the spatial analysis of large areas, the need becomes urgent for fast rasterization of massive multi-source geographic vector data. A parallel scanline algorithm is proposed for rapid rasterization. It provides a systematic solution to solve the complicated situation in parallel processing (cross-processor boundaries, common boundaries, and tiny polygons), thus ensuring the accuracy of the parallel scanline algorithm. The relationship of parallel speedup with the number of processors, the data partition pattern, and the raster grid size is discussed. Massive vector geographic data (approximately 0.7 million polygons) used in the experiment were effectively processed, thereby dramatically reducing the processing time and getting good speedup. •Propose a parallel scanline algorithm for rasterization of vector geographic data.•Discuss relation of speedup with processor number, partition pattern and scale.•Massive data is processed with largely shortened time and good speedup.
ISSN:0098-3004
1873-7803
DOI:10.1016/j.cageo.2013.05.005