期刊名称：International Journal of Grid and Distributed Computing
印刷版ISSN：2005-4262
出版年度：2016
卷号：9
期号：12
页码：35-50
出版社：SERSC
摘要：In order to solve the efficiency of buffer analysis of line elements, adopt plane graph model and according to the characteristic of simple feature model, making the bounding-edges of the line elements into plane graph model, then According to certain rules to filter the lines of plane graph model to gain the bounding edges of buffer and then gain the results. In this algorithm, firstly, As required, do parallel lines and polylines vertex processing for the line elements extracted from the objects which need buffer analysis , and gain the Intermediate line objects, then Generate line elements of graph model through computing intersecting points and clip lines using static R tree index, Moreover using the multiple programming standard OPENMP, Optimize the parallelism of every step of the vector buffer analysis algorithm, This algorithm can solve buffer efficient of large data and it’s is better than other algorithm in physical problem.
