Time Complexity Analysis of Two Non-angle Algorithms to Determine the Radial Spatial Adjacent Relationship

Taken the arc-arc topological relationship established on the nodes as an example the paper analyses the time complexity of two non-angle algorithms to determine the radial spatial adjacent relationship.The effectiveness of the two algorithms is discussed as well when the application range is extended to determine the spatial relationship of point sets.At the same time,it provides an efficient way that has the same function as the azimuth angle but is of lower time complexity.