摘要
以建立节点上弧段之间的拓扑关系为例 ,对比分析了两个非角度算法在确定射线的空间相邻关系时的时间复杂度 ,探讨了进一步将应用范围拓展到确定点集的空间关系时两种算法的有效性。研究表明 ,在这一类空间分析中基于Qi(xi,yi)函数的Qi 算法是一个时间复杂度低。
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.
出处
《武汉大学学报（信息科学版）》
EI
CSCD
北大核心
2003年第5期611-614,共4页
Geomatics and Information Science of Wuhan University
基金
国家自然科学基金资助项目 (4 0 0 0 10 17)
