地籍数据库点线拓扑一致性并行检查方法

摘要

The current topology inspection methods which use serial computation method accompanied with the complicated algorithms and excessive calculation amount cannot satisfy the demands of the efficient topology inspection for massive cadastral data.On the basis of the characteristics of topology calculation between point and line,the parallel topological computing method aiming at boundary points and lines has been implemented by combining the decomposition method for boundary points data with the Q tree and R tree spatial index method for boundary lines data.The topology parallel tests using the datasets of boundary points and lines in one area was taken in this method.The results show that the parallel efficiency of the algorithm which decreased with the increased number of processes steady maintains at above 30%,and the parallel speedup ratio reaches up to 5.The computation efficiency is improved more than 30 times than that of ArcGIS.The method can be used as a tool in high performance geographic information system and achieves good application effect.%针对拓扑检查算法复杂、计算量大，串行计算已远不能满足海量地籍数据高效拓扑检查需求的问题，在分析了点线拓扑关系的并行特点基础上，将界址点的数据划分方法与界址线的 Q&R 空间索引方法相结合，实现了界址点与界址线的并行拓扑计算。用某地区实际的界址点集与界址线集对点线拓扑并行检查进行实验。测试结果表明：并行检查算法的并行效率随着进程数的增加而有所衰减，但稳定在30％以上，加速比达到5以上，且相比于 ArcGIS 效率提升了30倍以上。并行检查方法以工具的方式集成应用于高性能地理计算平台中，应用效果良好。