Wei-Zhi Sun, Tingxin Ma, Jihong Ouyang, Da-you Liu
{"title":"基本基本方向约束的成对一致性检验","authors":"Wei-Zhi Sun, Tingxin Ma, Jihong Ouyang, Da-you Liu","doi":"10.1109/ICECTECH.2011.5941720","DOIUrl":null,"url":null,"abstract":"In this paper we study a formal model for qualitative spatial reasoning with cardinal direction relations called direction-relation matrix. We give an O(n2) algorithm to check the pairwise-consistency of basic cardinal direction constraints with the variables ranging over the set of simple regions. To the best of our knowledge, this was an open problem. A previous algorithm of the same model with our paper for this problem works in O(n3).","PeriodicalId":184011,"journal":{"name":"2011 3rd International Conference on Electronics Computer Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Pairwise-consistency checking of basic cardinal direction constraints\",\"authors\":\"Wei-Zhi Sun, Tingxin Ma, Jihong Ouyang, Da-you Liu\",\"doi\":\"10.1109/ICECTECH.2011.5941720\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we study a formal model for qualitative spatial reasoning with cardinal direction relations called direction-relation matrix. We give an O(n2) algorithm to check the pairwise-consistency of basic cardinal direction constraints with the variables ranging over the set of simple regions. To the best of our knowledge, this was an open problem. A previous algorithm of the same model with our paper for this problem works in O(n3).\",\"PeriodicalId\":184011,\"journal\":{\"name\":\"2011 3rd International Conference on Electronics Computer Technology\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-04-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 3rd International Conference on Electronics Computer Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICECTECH.2011.5941720\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 3rd International Conference on Electronics Computer Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICECTECH.2011.5941720","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Pairwise-consistency checking of basic cardinal direction constraints
In this paper we study a formal model for qualitative spatial reasoning with cardinal direction relations called direction-relation matrix. We give an O(n2) algorithm to check the pairwise-consistency of basic cardinal direction constraints with the variables ranging over the set of simple regions. To the best of our knowledge, this was an open problem. A previous algorithm of the same model with our paper for this problem works in O(n3).