It is essential to adopt parallel computing technology to rapidly rasterize massive polygon
data. In parallel rasterization, it is difficult to design an effective data decomposition method.
Conventional methods ignore load balancing of polygon complexity in parallel rasterization
and thus fail to achieve high parallel efficiency. In this paper, a novel data decomposition
method based on polygon complexity (DMPC) is proposed. First, four factors that possibly
affect the rasterization efficiency were investigated. Then, a metric represented by the …