梅雪良, 张祖勋, 张剑清. 最大集团图搜索法用于关系结构约束的全局等高线断线连接[J]. 武汉大学学报 ( 信息科学版), 1995, 20(2): 101-105.
引用本文: 梅雪良, 张祖勋, 张剑清. 最大集团图搜索法用于关系结构约束的全局等高线断线连接[J]. 武汉大学学报 ( 信息科学版), 1995, 20(2): 101-105.
Mai Xueliang, Zhang Zuxun, Zhang Jianqing. Global Broken Contour Connection Through Maximal Clique Graph Search Based on Relational Structural Constraints[J]. Geomatics and Information Science of Wuhan University, 1995, 20(2): 101-105.
Citation: Mai Xueliang, Zhang Zuxun, Zhang Jianqing. Global Broken Contour Connection Through Maximal Clique Graph Search Based on Relational Structural Constraints[J]. Geomatics and Information Science of Wuhan University, 1995, 20(2): 101-105.

最大集团图搜索法用于关系结构约束的全局等高线断线连接

Global Broken Contour Connection Through Maximal Clique Graph Search Based on Relational Structural Constraints

  • 摘要: 介绍了关系结构约束的全局等高线断线连接的最大集团图搜索法的原理与实现途径,实验中与局部断线连接方法作了对比实验。结果表明:全局连接具有自动纠错效果,具有更高的正确连接率。

     

    Abstract: This paper introduces the thorem of global broken contour connection through maximal clique graph search based on relational structural constraints.In the experiments,a comparison between the global broken contour connection method and local connection methods,has shown that our global method has the cap ability of automatic error-detection and has a higher rate of connection correctness.

     

/

返回文章
返回