多层次空间拓扑关系谓词计算方法.pdfVIP

41 8 Vo l141 N o1 8 2009 8 JOURNAL OF HARBIN INSTITUTE OF TECHNOLOGY Aug. 2009 1 2 樊 博 , 张志波 ( 1. , 2000 0, fanbo411@ 16 . com; 2. , 201204) : 空间拓扑关系谓词是信息系统中表示地理空间对象关系的方式. 为了提高谓词的匹配速度, 本 研 究空间拓扑关系谓词的模型表示方法和知识约简算法. 首先提出粗糙 9相交矩阵来实现空间拓扑关系的科 学建模, 进而提出五层次的拓扑关系谓词概念树来实现对空间拓扑关系的全面描述, 最后使用 ID 决策图技 术来简化拓扑关系谓词的知识表示. : 拓扑关系谓词; 粗糙 9相交矩阵; 决策图 : TP 111 5 : A : 0 67- 62 4( 2009) 08- 0244- 04 Com pu tation m ethod of spatial topological relation predicates w ith m u ltip le h ierarch ies 1 2 FAN Bo, ZHANG Zh-i bo ( 1. School of International and Public A ffairs, Shanghai Jiaotong University, Shanghai 2000 0, China; 2. Dept. of A cadem ics, Ch ina Execu tive Leadership Academy Pudong, Shanghai 201204, Ch ina) Abs tract: Spatial topological relation predicate is the description for representing the relationsh ip bewt een wt o geographical objects. In order to speed up the response tmi e of querying a spatial pred icate, this article deve-l opsmodeling m ethods and know ledge reduction algorithms of spatial pred icate. F irstly, rough 9-intersection matrix m ethod is proposed to establish a scientific topologicalmodel of spatial relations. Secondly, a conceptu- al tree w ith five h ierarchies is devised to describe the relationsh ip ofmu ltiple spatial predicates. F inally, ID decision graph is used to reduce the concept tree of spatial predicates. K ey w ord s: topological relation predicate; rough 9-intersection matrix; ID decision graph ; [ 4] - . ,