期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Computational Complexity of Spatial Reasoning with Directional Relationship
1
作者 MAO Jianhua GUO Qingsheng WANG Tao lecturer,Ph.D candidate,School of Resource and Environment Science,Wuhan University,129 Luoyu Road,Wuhan 430079,China. 《Geo-Spatial Information Science》 2002年第3期53-57,共5页
The property of NP_completeness of topologic spatial reasoning problem has been proved.According to the similarity of uncertainty with topologic spatial reasoning,the problem of directional spatial reasoning should be... The property of NP_completeness of topologic spatial reasoning problem has been proved.According to the similarity of uncertainty with topologic spatial reasoning,the problem of directional spatial reasoning should be also an NP_complete problem.The proof for the property of NP_completeness in directional spatial reasoning problem is based on two important transformations.After these transformations,a spatial configuration has been constructed based on directional constraints,and the property of NP_completeness in directional spatial reasoning has been proved with the help of the consistency of the constraints in the configuration. 展开更多
关键词 COMPUTATIONAL COMPLEXITY npcompleteness directional REASONING
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部