ThepropertyofNPcompletenessoftopologicspatialreasoningproblemhasbeenproved.Accordingtothesimilarityofuncertaintywithtopologicspatialreasoning,theproblemofdirectionalspatialreasoningshouldbealsoanNPcompleteproblem.TheproofforthepropertyofNPcompletenessindirectionalspatialreasoningproblemisbasedontwoimportanttransformations.Afterthesetransformations,aspatialconfigurationhasbeenconstructedbasedondirectionalconstraints,andthepropertyofNPcompletenessindirectionalspatialreasoninghasbeenprovedwiththehelpoftheconsistencyoftheconstraintsintheconfiguration.