摘要
ThepropertyofNPcompletenessoftopologicspatialreasoningproblemhasbeenproved.Accordingtothesimilarityofuncertaintywithtopologicspatialreasoning,theproblemofdirectionalspatialreasoningshouldbealsoanNPcompleteproblem.TheproofforthepropertyofNPcompletenessindirectionalspatialreasoningproblemisbasedontwoimportanttransformations.Afterthesetransformations,aspatialconfigurationhasbeenconstructedbasedondirectionalconstraints,andthepropertyofNPcompletenessindirectionalspatialreasoninghasbeenprovedwiththehelpoftheconsistencyoftheconstraintsintheconfiguration.
出版日期
2002年03月13日（中国期刊网平台首次上网日期，不代表论文的发表时间）
