期刊文献+

Computational Complexity of Spatial Reasoning with Directional Relationship

Computational Complexity of Spatial Reasoning with Directional Relationship
下载PDF
导出
摘要 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. 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.
出处 《Geo-Spatial Information Science》 2002年第3期53-57,共5页 地球空间信息科学学报(英文)
基金 theNationalNaturalScienceFoundationofChina (No.4 99710 6 8)
关键词 COMPUTATIONAL COMPLEXITY NPcompleteness directional REASONING computational complexity NP-completeness directional reasoning
  • 相关文献

参考文献3

  • 1[1]Peuquet D J,Zhang C X(1987) An algorithm to determine the directional relationships between arbitrarilyshaped polygons in the plane.Pattern Recognition,20(1):65-74
  • 2[2]Renz J,Webel B(1999) On the complexity of qualitative spatial reasoning:a maximal tractable fragment of the region connection calculus.Artificial Intelligence,108:69-123
  • 3[3]Garey M R,Johnson D S(1979) Computers and intractabilitya guide to the theory of NPcompleteness.San Francisco:Freeman.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部