提出了一整套矢量地图叠加分析算法：提出了大量点与多边形关系的包含性测试方法，首先对多边形进行预处理，然后采用射线法对单个点进行包含性测试；提出了基于双索引的大量线裁剪方法，分别以线、线段为基础建立两层索引，有效去除不必要的求交运算；面面叠加，基于改进的扫描线方法求取交点；通过对过同一点的线段分布情形的完备分类，涵盖了所有特殊类型的交点；在构造环的过程中，保存整型ID信息，并利用ID完成内环外环的匹配以及属性继承。以上几何计算方法及对应的叠加分析功能都已经实现，与最新研究成果的对比以及与ArcGIS对应功能的对比，都证明了其正确鲁棒、高效可用。上述实现已经应用于实际的GIS系统中，取得了良好的效果。

In this paper, we introduce a series of algorithms for vector map overlay: We proposed an algorithm for large amounts of points inclusion test, which first preprocesses the polygon and then adopts the ray-crossing idea for each point inclusion test. We proposed an algorithm for large amounts of lines clipping, which builds indexes on the whole line and the segment, and avoids unnecessary intersection-computing. For map overlay on polygons, we use the improved plane sweep algorithm to get all the intersection points, and the complete categories on distribution of segments passing the same point cover all the special cases of intersection points. We record the ID in the process of constructing the result rings, which simplifies the two processes-finding outer ring for holes and attribute propagation. All the geometric algorithms and the corresponding overlay functions are implemented, and the comparisons with the state-of-the-art algorithms and ArcGIS’s function demonstrate its correctness, robustness, efficiency and usability. The above functions have been used in GIS platform and work well.