摘要
采用方向关系矩阵模型表示空间区域最小边界矩形(MBR)间的关系,形式化描述了Skiadopoulos等提出的方向关系复合思想,并对其进行细化,提出方向关系矩阵复合方法,使方向关系复合易于实现;简化了Most运算,使复合过程更加简洁;通过定义取极小和取极大算子,实现了Most算法,为复合算法的提出奠定了基础;定义求幂运算符,实现了复合算法Com-pose并证明了算法的正确性,Compose算法的实现使方向关系复合从理论向应用更进一步。
In this work,the direction relation matrix is used to describe the relations between the Minimum Bounding Rectangles ( MBR ) of spatial regions. The composition of direction relations proposed by Skiadopoulos is formally described and refined. Then a composition method of direction relation matrix is proposed,which is easier to be realized. The proposed method simplifies the operation ‘Most’,making the process of composition more concise. By defining the minimum and maximal operators,the algorithm‘Most’ is realized,which provides the basis of the algorithm of composition. By defining the operator of power,the algorithm ‘Compose’ is realized and verified. The realization of the algorithm ‘Compose’ makes the composition easier for application.
出处
《吉林大学学报(工学版)》
EI
CAS
CSCD
北大核心
2010年第4期1048-1053,共6页
Journal of Jilin University:Engineering and Technology Edition
基金
国家自然科学基金项目(60603030
60773099
60873149
60973088)
'863'国家高技术研究发展计划项目(2006AA10Z245
2006AA10A309)
欧盟项目(BridgingtheGap
155776-EM-1-2009-1-IT-ERAMUNDUS-ECW-L12)
关键词
人工智能
方向关系矩阵
方向关系复合
Compose算法
artificial intelligence
direction relation matrix
composition of direction relations
algorithm of Compose