检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张水舰[1] 李永树[1] 鲁恒[1] 王子豪[1]
机构地区:[1]西南交通大学土木工程学院,四川成都610031
出 处:《公路交通科技》2010年第9期89-93,99,共6页Journal of Highway and Transportation Research and Development
基 金:"十一五"国家科技支撑计划课题资助项目(2006BAJ05A13)
摘 要:针对现有模型的不足,首先以点集拓扑学基本理论为基础,定义了交通网络中线目标的端点、内部、边界等概念,在此基础上提出了一种描述交通网络线-线拓扑关系完善的形式化模型即LL9I模型。在对此模型进行分析的基础上,根据线目标的物理意义,提出了10条规则以排除此模型描述的线-线拓扑关系中没有意义的类型,并总结出了交通网络线-线拓扑关系的最小集,定义了6种基本的线-线拓扑关系,并且证明了此最小集的互斥性与完备性。Aimed at the deficiency of the current models, the concepts of the endpoint, inner and boundary of linear object in traffic network were defined on the basis of basic theories of point-set topology at first, and a formalized model describing line-line topological relations in traffic network, LL9I model, was proposed accordingly. On the basis of analysis of the model, ten rules were put forward to exclude the insignificant line- line topological relations described by the model according to the physical meaning of linear object. Then the smallest set of line-line topological relations was proposed, six basic line-line topological relations were defined, and the exclusivity and perfectibility of the smallest set were proved.
关 键 词:交通工程 LL9I模型 点集拓扑学 交通网络线-线拓扑关系
分 类 号:TP311.52[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.147.45.232