中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
首页 机构 成果 学者
  
  1. CAS IR Grid
  2. 地理科学与资源研究所
  3. 中国科学院地理科学与资源研究所
Rasterization Computing-Based Parallel Vector Polygon Overlay Analysis Algorithms Using OpenMP and MPI

文献类型：期刊论文

作者Fan, Junfu1,2; He, Huixin1; Hu, Taoying1; Li, Guihua1; Qin, Liu1; Zhou, Yuke3
刊名IEEE ACCESS
出版日期2018
卷号6页码:21427-21441
关键词Overlay analysis parallel computing rasterization vector polygon clipping OpenMP and MPI
ISSN号2169-3536
DOI10.1109/ACCESS.2018.2825452
通讯作者Fan, Junfu(fanjf@sdut.edu.cn)
英文摘要Vector polygon overlay is a complex type of a geo-spatial analysis algorithm used in geographical information system, which requires increasingly higher computational efficiency given the rapid growth of spatial data sets. Parallel computing has provided an effective approach to improve the computational efficiency and expand the processing scales of polygon overlay algorithms. Polygon overlay analysis algorithms that are based on traditional vector polygon clipping algorithms will experience significant efficiency decreases when handling overlap among polygons that have quantities of vertices. The discretization processing method-based rasterization-based polygon clipping algorithm (RaPC) algorithm exhibits higher efficiency for addressing clipping issues among such polygons. In this paper, we designed and implemented two types of parallel polygon overlay analysis algorithms to determine the differences in efficiency between the RaPC algorithm and the Vatti algorithm under the open multi-processing and message passing interface parallel computing environments. The results show that parallel polygon overlay analysis methods based on the RaPC algorithm present advantages for processing overlap among large data sets. The parallel algorithm based on the Vatti algorithm presents higher efficiency when handling overlap among small spatial data sets. The discretization process between two overlapped geometries of the RaPC algorithm provided a potential approach to solve the polygon overlay problem using a fine-grained parallelization method.
资助项目National Natural Science Foundation of China[41501425] ; National Natural Science Foundation of China[41471330] ; National Key Research and Development Program of China[2017YEB0503500] ; Key Research and Development Program of Shandong Province[2016GSF122006] ; Project of Shandong Province Higher Educational Science and Technology Program[J16LH03] ; Young Teacher Development Support Program of the Shandong University of Technology[4072-115016]
WOS研究方向Computer Science ; Engineering ; Telecommunications
语种英语
WOS记录号WOS:000431638100001
出版者IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
资助机构National Natural Science Foundation of China ; National Key Research and Development Program of China ; Key Research and Development Program of Shandong Province ; Project of Shandong Province Higher Educational Science and Technology Program ; Young Teacher Development Support Program of the Shandong University of Technology
源URL[http://ir.igsnrr.ac.cn/handle/311030/55013]  
专题中国科学院地理科学与资源研究所
通讯作者Fan, Junfu
作者单位1.Shandong Univ Technol, Sch Civil & Architectural Engn, Zibo 255000, Peoples R China
2.Chinese Acad Sci, Inst Geog Sci & Nat Resources Res, State Key Lab Resources & Environm Informat Syst, Beijing 100101, Peoples R China
3.Chinese Acad Sci, Inst Geog Sci & Nat Resources Res, Ecol Observing Network & Modeling Lab, Beijing 100101, Peoples R China
推荐引用方式
GB/T 7714		 Fan, Junfu,He, Huixin,Hu, Taoying,et al. Rasterization Computing-Based Parallel Vector Polygon Overlay Analysis Algorithms Using OpenMP and MPI[J]. IEEE ACCESS,2018,6:21427-21441.
APA Fan, Junfu,He, Huixin,Hu, Taoying,Li, Guihua,Qin, Liu,&Zhou, Yuke.(2018).Rasterization Computing-Based Parallel Vector Polygon Overlay Analysis Algorithms Using OpenMP and MPI.IEEE ACCESS,6,21427-21441.
MLA Fan, Junfu,et al."Rasterization Computing-Based Parallel Vector Polygon Overlay Analysis Algorithms Using OpenMP and MPI".IEEE ACCESS 6(2018):21427-21441.

入库方式： OAI收割

来源：地理科学与资源研究所

浏览0
下载0
收藏0
其他版本

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。