摘要
基于Egenhofer的19种线面拓扑关系,提出OR算法并证明了OR算法的正确性,使用OR算法可求解复合线段与同一区域的拓扑关系矩阵.利用OR算法在19种拓扑关系中找到5种具有相互独立关系的集合SM,证明了集合SM是表达19种线面拓扑关系的元数最小集,集合SM有助于推导复杂的线面拓扑关系,使线面拓扑关系的表达更加简洁.为进一步研究线面拓扑关系的推理,给出了从SM推导出其他拓扑关系的推导图.
Based on Egenhofer＇s nineteen relations between line and region, algorithm OR was presented and verified. Via algorithm OR, the topological relation matrix between a composite line and a region can be derived. Five mutually exclusive relations, denoted by SM, were distinguished from the original nineteen relations by means of algorithm OR. It was proved that SM was the minimal set of basic relations to express the nineteen relations. SM is useful for reasoning complex relations between line and region, and makes it more concise to represent the topological relations between line and region. In order to further study the reasoning of the topological relations between line and region, the derivation graph for deriving other relations from SM was given.
出处
《吉林大学学报（理学版）》
CAS
CSCD
北大核心
2007年第4期567-571,共5页
Journal of Jilin University:Science Edition
基金
国家自然科学基金重大项目基金(批准号:60496321)
国家自然科学基金(批准号:60573073)
国家863高技术研究发展计划项目基金(批准号:2006AA10Z2452006AA10A309)
吉林省科技发展计划重大项目基金(批准号:20020303)
吉林省科技发展计划项目基金(批准号:20030523)和欧盟项目(批准号:TH/AsiaLink/010(111084))
关键词
拓扑关系
线段
区域
OR算法
topological relation
line
region
OR algorithm
