首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于Delaunay三角网的空间邻近关系推理
引用本文:杜晓初,郭庆胜.基于Delaunay三角网的空间邻近关系推理[J].测绘科学,2004,29(6):65-67.
作者姓名:杜晓初  郭庆胜
作者单位:武汉大学资源与环境科学学院,武汉,430079;武汉大学资源与环境科学学院,武汉,430079
摘    要:空间邻近关系是一种重要的空间关系,对这种关系的识别是任何空间建模系统所必须的。Delaunay三角网是根据最小角最大规则建立的一种三角剖分,可以较好地表达空间目标之间的邻近关系。利用Delaunay三角网对空间邻近关系进行了描述,在此基础上提出了空间邻近关系推理方法。

关 键 词:空间邻近关系  空间推理  Delaunay三角网
文章编号:1009-2307(2004)06-0065-03
修稿时间:2004年5月26日

Spatial neighborhood relation reasoning based on delaunay triangulation
DU Xiao-chu,GUO Qing-sheng.Spatial neighborhood relation reasoning based on delaunay triangulation[J].Science of Surveying and Mapping,2004,29(6):65-67.
Authors:DU Xiao-chu  GUO Qing-sheng
Abstract:Spatial neighborhood relation is an important spatial relation. It is necessary to distinguish this kind of relation for any spatial modeling system. Delaunay Triangulation, which can represent neighborhood relation between spatial objects expediently, is a triangle partition according to the maximizing smallest angles rule. In this paper, spatial neighborhood relation is represented by Delaunay Triangulation, Based on that, methods of spatial neighborhood relation reasoning are presented.
Keywords:spatial neighborhood relation  spatial reasoning  Delaunay Triangulation
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号