中文摘要：

现有的矢量空间叠置分析多采用拓扑模型，要求建立完整的数据拓扑关系。该文采用简单要素模型，以多边形叠置交运算为例，介绍简单要素模型下空间叠置分析的具体实现，着重讨论多边形交运算的交替搜索算法，在线段求交中对连续出入点、重交点等特殊数据进行处理。在实际应用中，该算法可较好解决大规模复杂数据层的叠置交运算，比同规模的拓扑叠置运算效率高。

英文摘要：

Most of the vector overlay analysis algorithms use the topological data model which requests the individual layers have planar enforcement. In order to avoid the topological relation building and improve the efficiency of the overlay operation, some GIS platforms bring in the simple data structure. This paper discusses the overlay analysis algorithm of simple data structure and takes the polygon intersection operation as an example to introduce the algorithm design and implement. The main problem during the polygon overlay is the spurious polygons and ‘coastline weave＇, which tends to arise when two lines are overlaid, which are actually slightly different versions of the same line. This paper emphasizes on the solution of the problem of the in - point or out - point serious and the repeated points and the alternative searching of the polygon intersection. Performance tests show this algorithm is more efficient and quick than the operation based on the topological model especially when the data quantity goes to large.