Clipping Computing Model for Vector Map at the Layers’ Level

  • 1. State Key Laboratory of Remote Sensing Science, Institute of Remote Sensing and Digital Earth, CAS, Beijing 100094, China;
    2. Beijing Geobeans Information Technology Co. Ltd, Beijing 100101, China

Received date: 2013-01-14

  Revised date: 2013-04-24

  Online published: 2013-08-08


Clipping function is one of the fundamental functions in Geographic Information System. The efficiency of clipping function can greatly affect the overall performance of data processing in GIS application, especially when clipping large vector data. This paper proposes a new clipping computing model to effectively fulfill the clipping function for different types of clipped layers according to their different attribute and geometry characteristic, such as point, line, polygon, multi-point, multi-line, multi-polygon and so on. This clipping computing model consists of the following three steps: first of all, using clip-layer's Minimum Bounding Rectangle to select features from clipped-layer, where the features must intersect with or within the clip-layer's Minimum Bounding Rectangle; secondly, using Feature ID to build revised quad-tree index for the clip-layer features; lastly, using thread-pool to fulfill clip computing in parallel. A performance test was carried out using four different vector data layers. The result shows that the performance of clipping function based on this clipping computing model is as efficient as the one fulfilled in ESRI's ArcGIS 10.0. CPU-intensive is one drawback of the implementation of this model at its current form.

Cite this article

WANG Qiang-Gang, TIAN Sheng-Jun, FAN Xie-Yu, YANG Yan-Jing . Clipping Computing Model for Vector Map at the Layers’ Level[J]. Journal of Geo-information Science, 2013 , 15(4) : 532 -537 . DOI: 10.3724/SP.J.1047.2013.00532


[1] Weiler K, Atherton P. Hidden surface removal using polygon area sorting[C]. The SIG GRAPH’77,New York,1977.

[2] Vatti B R.A generic solution to polygon clipping[J].Communications of the ACM,1992,35(1):56-63.

[3] Greiner G, Hormann K. Efficient clipping of arbitrary polygons[J]. ACM Transactions on Graphic,1998,17(2):71-83.

[4] Xie Z,Wei D Q,Wu L. Graph model of polygon clipping using simple vector data[J].ActaGeodaetica et CartographicaSinica,2009,38(4):369-374.

[5] 马丽娜.面向大规模空间数据的空间计算模式研究与实现[D].北京:中国地质大学,2011.

[6] 董鹏,杨崇俊,芮小平,等.一种基于改进四叉树的GIS空间选择查询算法[J].计算机工程与应用,2003,39(13):58-61.

[7] 董鹏,李津平,白予琦,等.基于改进四叉树索引的矢量地图叠加分析算法[J].计算机辅助设计与图形学,2004,16(4):530-534.

[8] 陈述彭,鲁学军,周成虎,等.地理信息系统导论[M].北京:科学出版社,1999.

[9] Theodoridis Y, Sellis T, Papadopolos A N, et al. Specifications for efficient indexing in spatiotemporal databases[C].SSDBM’98, Capri, 1998.

[10] 余登峰.基于R树的空间数据索引技术研究与实现[D].北京:中国地质大学,2006.

[11] 郭菁,郭嶶,胡志勇,等.大型GIS空间数据库的有效索引结构QR-树[J].武汉大学学报(信息科学版),2003,28(3):306-310.

[12] 唐继勇,白新跃,杨峰,等.基于DPS+-Tree的索引复制策略研究[J].计算机科学,2005,32(11):112-114.

[13] 朱庆,林珲.数码城市地理信息系统[M].武汉:武汉大学出版社,2004,38-44.

[14] 王华,马亮,顾明,等.线程池技术研究与应用[J].计算机应用研究,2005(11):141-142.

[15] 庞丽萍.操作系统原理(第三版)[M].武汉:华中科技大学出版社,2000.



[18] 李玮顾,郝香山,程俊,等.GIS云服务平台体系架构与技术实现[C].2011年SuperMap GIS技术大会论文,2011.

[19] 杜书杰,林晓彤.分布式计算模式中影响算法性能的主要因素[J].计算机工程,29(16):162-164.

[20] 刘丽艳.基于数据网格的海量数据管理若干关键技术研究[D].北京:中国科学院研究生院,2005.