GIS矢量数据的拓扑空间模糊划分模型

在地理信息系统（GIS）中,针对现实世界复杂的地理现象和地理实体具有模糊不确定性而造成实体之间拓扑关系描述困难的问题,文中首先从四交模型和九交模型对空间实体间拓扑关系进行概述,然后在点集拓扑学的基础上,分析了复杂的模糊地理实体间拓扑关系形式化描述模型,并对该模型进行详细、准确的形式化描述和严格的数学表达,最后提出对模糊地理实体拓扑划分的改进方法和扩展模型。分析结果表明,该模型可以实现从简单实体到复杂实体的分析和模糊划分。     

B样条法建立功能梯度义齿模型技术

为提高STL模型切片效率,节省系统资源,提出STL模型分层邻接排序快速切片算法.采用邻接插入法建立三角形邻接关系,根据三角形各点坐标在切片方向上投影的最大值和最小值反求与此三角形相交的切片平面,并通过分析相邻2个三角形公共边与切片平面的位置关系,按邻接顺序建立交点链表.与已有的基于STL全模型拓扑信息提取的切片算法以及分组矩阵切片算法相比,文中算法不进行整体拓扑信息的提取和三角形的分组排序,而是将三角形顺序关系融合于交点链表中,从而达到节省系统资源、提高切片效率的目的.最后通过对壳体实体切片实例的分析,验证了该算法的可行性和高效性.     

装配空间关系形式表达

装配空间关系形式表达是实现产品装配空间语义查询、分析和装配序列规划的基础.结合机械产品装配的特点,对装配空间的拓扑关系和方向关系进行分析,提出空间拓扑的邻接关系、插入关系和分离关系;基于形态分类学和拓扑集描述逻辑理论,给出装配空间拓扑关系和方向关系相结合的装配空间关系的形式表达;通过三维实体边界几何处理,实现形式表达中原子关系的定义;基于形式表达语义的推理方法,自动建立复杂装配体之间空间关系,并且可以将自动标注的空间关系基于本体的RDF/XML文档输出.最后给出一个注射模装配空间关系自动标注及形式表达的实例,结果表明,文中提出的语义推理方法能较好地实现装配关系的形式表达.     

用Voronoi多边形扩展的空间数据模型

Voronoi图是一种基本几何结构 ,也是解决相关几何问题的有效的工具 .为了有效地解决 GIS中的空间目标间关系的动态构建、显示等问题 ,首先重点探讨了用 Voronoi图扩展的空间数据模型 ,然后主要从空间数据建模语义的角度出发 ,在研究 GIS面向对象的空间数据模型的基础上 ,提出了用 Voronoi多边形来部分地代替面向对象的数据模型间的关系定义 ,并给出了一个基于 Voronoi多边形的面向对象数据模型的框架 .该模型由于利用了Voronoi图具有的能良好地表示空间目标邻近关系的特性 ,并且由于通过空间目标的位置 ,能动态地获取和显示空间目标间的邻接关系 ,因而可以有效地弥补目前拓扑数据模型中 ,计算更新复杂及不能表示空间上邻近 ,而几何上不相接目标间的空间关系和栅格数据模型中不能有效地表达目标间拓扑关系的不足的问题 ,实践证明 ,这是一种较为理想的表示复杂空间关系的数据模型 .     

STL面片邻接拓扑关系重构及其应用

STL文件描述的是一种离散的实体表面三角面片模型,在实际处理中一般需要重新构造其邻接拓扑关系(包括面片的邻接面、顶点的邻接面、邻接顶点等关系）。而剔除STL面片数据中的冗余顶点是重构的关键,该算法已经成功应用于三维真实感注塑模流动模拟软件的3D图形处理。     

地下空间三维数据模型分析与设计

三维空间数据模型是地下空间三维建模的基础。讨论了地下空间三维数据模型设计的实体依赖性、数据依赖性、需求依赖性和实现依赖性等特性,并分析了当前地下空间建模的三维数据模型存在的不足,提出了一种新的面向对象的地下空间三维矢量拓扑数据模型。初步实验结果表明,该模型在地下空间对象的存储管理、查询分析以及模型动态编辑等方面都表现出较好的性能。     

基于邻接关系的空间数据挖掘

空间邻接关系是空间数据库对象之间的特征联系，其处理过程直接影响着空间数据挖掘算法的实现与效率，基于3种邻接关系，给出了邻接图，邻接路径的概念和几个基本操作，并分析了几种典型的空间数据挖掘算法。     

基于状态和变化的统一时空数据模型

提出了一个基于状态和变化的统一时空数据模型SCUDM(state and change based unified spatio-temporial datamodel).时空数据库的状态是关于对象、空间和时间的三元组,时空数据库的变化就是状态的变化.按照对象域、空间域和时间域将时空数据库中的变化分别投影分解,显式地表达在对象、空间和时间上的变化.而事件是在某一时刻前后,时空实体的变化关系,在事件表达中蕴涵了空间实体之间的时间拓扑关系.SCUDM不仅支持状态和变化的表达,而且支持时间拓扑和空间拓扑的表达.     

基于网络环境的3D GIS空间数据模型研究

三维地理信息系统应该充分利用第三维,提供有效空间分析功能。论文提出了一种面向分析的空间三维数据模型,在这个模型上基于几何拓扑关系的空间分析得以方便的实现。每种模型有不同种表现形式。LOD算法、空间索引和渐进数据传输使这种模型在网络环境上传输得以实现。     

基于矢量建模的AUV水下目标探测仿真方法研究

采用矢量建模与虚拟仿真技术,模拟自主水下机器人(Autonomous Underwater vehicle,AUV)环境感知功能,对目标探测传感器视域及目标特征进行矢量建模。根据目标探测传感器的特征参数,利用边界矢量点描述目标探测的视域范围。以三维地理信息系统理论为基础,采用基于面向对象数据模型和基于表面三角剖分的方法来构建水下目标的三维空间数据模型。以三角形的空间拓扑关系为基础,分析了任意两实体的空间拓扑关系,并将其用于水下未知目标探测。通过水下目标的建模实例和探测仿真实例验证了建模与目标探测方法的正确性和可行性。     

一种新的基于邻接矩阵的拓扑排序算法

为了降低基于邻接矩阵的拓扑排序算法的复杂性，将单顶点算法框架扩展成集合算法框架，给出一些便于进行拓扑排序的有向无环图的性质。在此基础上，定义了适合进行弧删除操作和无前驱顶点判断的邻接矩阵运算，给出了有向弧邻接矩阵的存储方案，最终提出了一种时间和空间复杂度都比较低的拓扑排序算法。     

单线图动态规划最优布局成图技术

提出了一种基于动态规划算法得到布局最优解实现区域电网单线图生成的方法.根据电网空间数据构建拓扑模型,执行广度优先算法得到多个能构成连通图的邻接矩阵以及矩阵遍历序列,根据邻接矩阵宽度计算出能容纳全部设备的正方形范围,并建立了设备最小间距为优化目标的数学模型.提出了动态规划最优布局求解的算法,应用该算法求解布局最优解数组,最后按照最少交叉原则进行正交化处理.应用实例表明通过最优解布局的成图美观且高效.     

基于动态规划思想求解关键路径的算法

关键路径通常是在拓扑排序的基础上求得的。提出了一种利用图的广度优先搜索与动态规划算法相结合求解关键路径的新算法,该算法采用图的邻接表结构形式,不需要进行拓扑排序,较传统的算法具有较高的效率,同时具有较高的健壮性。     

Performance evaluation of boundary data structures

Boundary representations, or B-reps, are a solid modeling technique with widespread applications in computer-aided design, computer-aided manufacturing, and robotics. B-reps have evolved considerably in recent years, and advances in theoretic studies-particularly in topological models and associated operators-make it possible now to model nonorientable, nonmanifold objects, as well as orientable, manifold objects. Boundary data structures are normally built on the adjacency relations between faces, edges, and vertices. The analytic method presented here identifies optimal combinations of relations for building these structures     

Representing topological relationships for spatiotemporal objects

Several representations have been created to store topological information in normal spatial databases. Some work has also been done to represent topology for 3D objects, and such representations could be used to store topology for spatiotemporal objects. However, using 3D models has some disadvantages with regards to retrieving snapshots of the database. This paper aims at creating a spatiotemporal version of the sliced representation that supports efficient retrieval of snapshots of the past and that supports enforcing topological relationships. This paper aims to extend an earlier representation of moving objects so that it can also store and enforce some of the topological relationships between the objects. One use of such a representation is storing a changing spatial partition. As part of the effort to construct the model, an analysis of the topological relationships has been carried out to see which need to be stored explicitly and which can be computed from geometry. Both a basic time slice model and a 3D model are examined to determine how suitable they are for storing topological relationships. An extension of the time slice model is then proposed that solves some of the problems of the basic time slice model. Some algorithms for constructing the new model from snapshots of the objects along with an adjacency graph have been created. The paper also contains a short analysis on how to handle current time, as the time slice model is best at handling historical data, and on ways to speed up searches in a database in which objects of many types are connected to one another and many files therefore potentially need to be accessed.     

Spatial learning for navigation in dynamic environments

This article describes techniques that have been developed for spatial learning in dynamic environments and a mobile robot system, ELDEN, that integrates these techniques for exploration and navigation. In this research, we introduce the concept of adaptive place networks, incrementally-constructed spatial representations that incorporate variable-confidence links to model uncertainty about topological adjacency. These networks guide the robot's navigation while constantly adapting to any topological changes that are encountered. ELDEN integrates these networks with a reactive controller that is robust to transient changes in the environment and a relocalization system that uses evidence grids to recalibrate dead reckoning.     

Reasoning about geological space: Coupling 3D GeoModels and topological queries as an aid to spatial data selection

Topological relationships between geological objects are of great interest for mining and petroleum exploration. Indeed, adjacency, inclusion and intersection are common relationships between geological objects such as faults, geological units, fractures, mineralized zones and reservoirs. However, in the context of 3D modeling, actual geometric data models used to store those objects are not designed to manage explicit topological relationships. For example, with Gocad^© software, topological analyses are possible but they require a series of successive manipulations and are time consuming. This paper presents the development of a 3D topological query prototype, TQuery, compatible with Gocad^© modeling platform. It allows the user to export Gocad^© objects to a data storage model that regularizes the topological relationships between objects. The development of TQuery was oriented towards the use of volumetric objects that are composed of tetrahedrons. Exported data are then retrieved and used for 3D topological and spatial queries. One of the advantages of TQuery is that different types of objects can be queried at the same time without restricting the operations to voxel regions. TQuery allows the user to analyze data more quickly and efficiently and does not require a 3D modeling specialist to use it, which is particularly attractive in the context of a decision-making aid. The prototype was tested on a 3D GeoModel of a continental red-bed copper deposit in the Silurian Robitaille Formation (Transfiguration property, Québec, Canada).     

Hierarchical structure to winged-edge structure: a conversion algorithm

The winged-edge data structure is advantageous for traversing the topological graph of the boundary representation of a solid object. This paper presents an algorithm for converting hierarchical boundary representations into representations in the winged-edge data structure. As a result of the conversion, the adjacency relationships of geometric entities embedded in hierarchical boundary representations,-which may be evaluated through boundary evaluation on solid objects defined via Boolean set-operations, can be easily and efficiently accessed.