基于平面分割的线/线相接、交叉类型判断

线/线交包括多种细分情况，其中线目标间的相接、交叉细分关系的区分在空间数据建模、更新与质量控制等应用中有着重要的作用。本文针对目前线/线相接、交叉关系判断方面的局限性，提出了一种基于平面分割的线/线交“相接”、“交叉”类型判别算法。该算法是以在线/线交的邻域内，一条线总是把邻域分割成两个平面区域为基础，通过判断另一条线中与交相连的两线段是否处在同一个平面区域来判断线/线交的“相接”、“交叉”类型。本文用Visual C#语言编程实现了该方法，并将其应用到时空数据更新系统中，取得了较好的应用效果。

An algorithm for determining the touching and crossing relations between a pair of lines based on one line splitting plane to two parts

Touching and crossing are two important refined intersection types in the line/ line topological relations. They usually play important roles in spatial dada modeling, quality control, and updating. In order to overcome the limitations of determining the refinement cases, i.e., touching and crossing in the current literatures, a new algorithm is presented in this paper. This algorithm is based on the foundation that a line splits the neighborhood into two parts. If we can determine the other line is located on only one part or on the two sides, we can distinguish the refined cases of intersections. The algorithm has been developed using Visual C#, and have made good application effect in GIS database updating system.