Computational Complexity of Spatial Reasoning with Directional Relationship

(整期优先)网络出版时间:2002-03-13
/ 1
ThepropertyofNPcompletenessoftopologicspatialreasoningproblemhasbeenproved.Accordingtothesimilarityofuncertaintywithtopologicspatialreasoning,theproblemofdirectionalspatialreasoningshouldbealsoanNPcompleteproblem.TheproofforthepropertyofNPcompletenessindirectionalspatialreasoningproblemisbasedontwoimportanttransformations.Afterthesetransformations,aspatialconfigurationhasbeenconstructedbasedondirectionalconstraints,andthepropertyofNPcompletenessindirectionalspatialreasoninghasbeenprovedwiththehelpoftheconsistencyoftheconstraintsintheconfiguration.