Acta Geodaetica et Cartographica Sinica ›› 2014, Vol. 43 ›› Issue (2): 186-192.

Previous Articles     Next Articles

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

  

  • Received:2012-11-22 Revised:2013-12-02 Online:2014-02-20 Published:2014-02-28

Abstract:

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.

CLC Number: