Algorithms for Tetrahedral Network(ten) generation

1 IntroductionA fulI 3-D GIS is needed in rnany gerecience ap-plication fields, such as goology, mine, oil and en-virorunental engineering, etc. Not only medelingand visualization but also rnanipulation are requiredin these applications. But the traditional 2-D GIShas difficulty in satisfying these fequirements, es-pecially in the representation of vertical infOrma-tion. Although a number Of studies have been dOneby researchers in the world (Molenaar, 1992; RaPerand Kelk, 199l; Li Rong…     

A design of three-dimensional spatial data model and its data structure in geological exploration engineering

The key to develop 3-D GISs is the study on 3-D data model and data structure. Some of the data models and data structures have been presented by scholars. Because of the complexity of 3-D spatial phenomenon, there are no perfect data structures that can describe all spatial entities. Every data structure has its own advantages and disadvantages. It is difficult to design a single data structure to meet different needs. The important subject in the 3-D data models is developing a data model that has integrated vector and raster data structures. A special 3-D spatial data model based on distributing features of spatial entities should be designed. We took the geological exploration engineering as the research background and designed an integrated data model whose data structures integrats vector and raster data by adopting object-oriented technique. Research achievements are presented in this paper.     

A design of three-dimensional spatial data model and its data structure in geological exploration engineering

The key to develop 3-D GISs is the study on 3-D data model and data structure. Some of the data models and data structures have been presented by scholars. Because of the complexity of 3-D spatial phenomenon, there are no perfect data structures that can describe all spatial entities. Every data structure has its own advantages and disadvantages. It is difficult to design a single data structure to meet different needs. The important subject in the3-D data models is developing a data model that has integrated vector and raster data structures. A special 3-D spatial data model based on distributing features of spatial entities should be designed. We took the geological exploration engineering as the research background and designed an integrated data model whose data structures integrats vector and raster data byadopting object-oriented technique. Research achievements are presented in this paper.     

An integrated data model in three dimensional GIS

The current GIS can only deal with 2-D or 2.5-D information on the earth surface. A new 3-D data structure and data model need to be designed for the 3-D GIS. This paper analyzes diverse 3-D spatial phenomena from mine to geology and their complicated relations, and proposes several new kinds of spatial objects including cross-section, column body and digital surface model to represent some special spatial phenomena like tunnels and irregular surfaces of an ore body. An integrated data structure including vector, raster and object-oriented data models is used to represent various 3-D spatial objects and their relations. The integrated data structure and object-oriented data model can be used as bases to design and realize a 3-D geographic information system.     

三维空间数据模型集成的概念框架研究

本文对三维空间数据模型的研究与发展进行了总结,分析了三维空间数据的特点以及数据模型集成的必要性。结合三维ＧＩＳ在城市、地质、海洋等领域的具体应用,提出三种三维空间数据模型集成：用于城市三维构模基于ＴＩＮ和ＣＳＧ的集成模型;用于地质,海洋等领域的基于八叉树和四面体格网的混合模型;具有一般性的矢量栅格集成的三维空间数据模型。     

关于3维矿山建模的探讨

在矿山3维可视化的过程中,最重要的是建模和可视化的研究。文中主要讨论了3维建模的一些常用方法。3维模型的建立主要基于以下数据结构,如规则格网法、TIN、3维栅格、3维矢量、八叉树、TEN等结构,通过这些数据结构可以实现不同特点的矿山3维表达与模拟。     

面向目标的栅格矢量一体化三维数据模型

首先对现有的三维空间数据模型进行了讨论 ,分析了栅格、矢量和混合数据模型的特点 ,提出了一种面向目标的栅格矢量一体化数据模型。该模型将栅格数据以矢量方式进行组织 ,从而同时具有矢量和栅格数据模型的优点 ,也克服了目前普遍应用的混合模型所存在的缺点。还提出了一种三维空间的三级栅格划分和行次序编码方法。该方法存储空间小 ,便于快速索引和计算。最后 ,给出了具体的数据结构     

面积误差最小约束下矢量数据向栅格数据转换的优化算法

在总结现有的矢量数据向栅格数据转换算法的基础上,提出一种面积误差最小约束下的优化算法。该算法保证了多边形矢量数据在栅格化后的面积误差尽可能最小,从而提高所得栅格数据在面积分析相关领域中应用的可信度。     

GIS中面状要素矢量栅格化的面积误差分析

在探讨矢量栅格化的几种形式和产生误差原因的基础上,系统分析在面状要素矢量栅格化的误差分析方法研究方面所取得的进展,指出当前分析方法存在的主要问题,并提出利用结构性栅格数据进行面状要素矢量栅格化的误差分析方法,然后以土地利用数据的栅格化为例进行实证研究。研究表明,常规分析方法很大程度上低估了栅格化的误差,因为没有充分考虑栅格化误差存在空间上的"此消彼长"现象。建议采用结构性栅格数据来改善栅格化误差分析,对误差作基于格网的量化计算,并标记在单元格上。它能有效地区分"此消"与"彼长"导致的误差,使面状要素栅格化的误差分析更加全面、客观、准确,且容易进行误差的量化分析与表示。     

横-纵扫描的Voronoi图栅格生成算法

Voronoi图是计算几何学中一个重要数据结构,在诸多领域具有广泛的应用。栅格扫描算法符合计算机离散特征,优化了欧氏距离算法,是最优的栅格Voronoi图生成算法之一。但是,由于栅格单元距离与欧氏距离的差异,在扫描过程中部分单元的归属不可避免地产生一定的误差,使栅格Voronoi图的应用受到一定限制。本文针对传统扫描算法存在的误差缺陷,提出了一种基于横-纵扫描的栅格Voronoi图改进生成算法。首先,深入分析了传统扫描算法产生误差缺陷的原因和区域分布特征;然后,以3×3邻域为模板,在一个正常周期的水平(横向)扫描后,增加一个周期竖直(纵向)扫描,即通过横-纵两个周期扫描实现Voronoi图的准确生成;最后,应用不同的栅格数据进行了试验对比,结果表明:改进后的算法既具备扫描算法效率上的优势,同时解决了原算法扫描的误差缺陷,在高效生成的同时把误差限制在一个格网以内。     

基于游程编码的GIS栅格数据矢量化方法

为了克服传统栅格矢量化方法的各种局限性,提出利用栅格的游程编码和区位表在内存中直接进行栅格图形矢量化提取的有效方法,并描述了算法实现步骤.由于栅格游程编码具有提取方便、压缩比适中、和常规栅格之间的转换便捷等特征,所以本方法的采用使得在计算机内存中处理矢量化栅格的规模、精度、复杂程度和速度有较大提高,可广泛应用于栅格型地理空间分析和遥感图像专题要素类型的边界提取等方面,实践表明本文提出算法具有很高的效率,易于实现.     

利用数学形态学提取骨架线的改进算法

地图数字化生产和数字地图编绘中都需要用到提取骨架线算法,如矢量化和等级变换等。提取骨架线的算法较多,基于栅格数据的算法通常采用数学形态学方法,对于矢量数据目前较有代表性的是利用约束Delau-nay三角网提取骨架线。本文给出一种利用数学形态学提取骨架线的改进算法,适用于栅格和矢量数据,并能在矢量化时建立高质量的拓扑关系,还较好地克服了数学形态学方法的缺点——节点畸变和端点内缩。实验表明该算法稳定且行之有效。     

基于栅格数据的最优路径算法分析与设计

最优路径分析是GIS中基本空间分析之一,迄今为止,国内外出现不少关于最短路径/最优路径算法的研究,但其数据模型主要以矢量数据模型或网络模型为主,而建立在栅格数据模型上的最优路径算法的相关研究较少。基于栅格的最优路径算法是一些专业应用模型的基础,如道路通达度模型、城市引力模型、洪水演进过程模型等,其算法设计非常重要。本文在前人的研究基础上,提出一种用于计算栅格最优路径的算法,对其计算过程进行了详细的分析与描述,并根据实验结果总结了其优点和缺点。     

多边形拓扑关系构建的栅格算法

矢量数据拓扑关系的自动建立是GIS软件的核心模块之一，也是技术难点之一。简要分析传统算法的优缺点，在此基础上，借鉴基栅格的种子点填充算法和矢量数据求交的栅格探测法的思想，提出建立图幅多边形与弧段所属关系的栅格算法，给出算法的各主要步骤和实现方法。分析与试验表明，新算法在特殊情况处理、多边形内点自动建立、处理效率、简化编程等方面有一定优势。     

地形分析中栅格中间层构建的尺度适应性

栅格中间层是指在地形分析中由DEM、DSM、矢量数据等原始数据,经过一系列栅格运算获取且可以重用的基础栅格层。本文系统研究了栅格中间层构建的尺度适应性,定义了范围、比例尺、分辨率和分析4种尺度,并确定了范围、比例尺和分辨率尺度的确定原则;特别对于分析尺度,通过地貌因子计算进行了切线、剖面曲率栅格层分析尺度适宜性试验,分析了曲率计算中适宜的算法和分析尺度,保证了地形基础因子栅格中间层具有满足分析要求的数值精度和匹配地形起伏的形态精度。     

基于矢量评估单元的模糊综合评价在GIS中的实现

模糊综合评价与GIS空间分析功能的融合应用,使基于GIS的模糊综合评价显示出强大的优势。由于栅格模型计算方便,目前GIS模糊综合评价中基本采用栅格评估单元,但栅格单元由人为指定单元大小,其单元大小和形状不一、边界复杂、空间运算时隶属度与权重等属性结构设计较难实现,大大限制了其在模糊综合评价中的应用。本文介绍了在GIS中采用矢量评估单元实现模糊综合评价的基本方法,探讨了在矢量评估单元的属性结构中设计单元的隶属度和权重等属性的关键技术,为矢量评估单元在GIS模糊综合评价中的应用提供了经验。     

Finding least-cost paths across a continuous raster surface with discrete vector networks

The problem of finding the least-cost path from a source point to a destination point can be dealt with by routing across a continuous surface or routing along a discrete network. The solutions within these two contexts are linked to the use of a raster- or a vector-based least-cost path algorithm. This study presents a technique which integrates raster- and vector-based least-cost path algorithms for determining the least-cost path across a continuous raster surface with discrete vector networks. The technique incorporates ancillary vector data sets that are required to examine the travel cost at each link, connections between nodes, and the representation of intersecting links in the discrete vector network into raster-based least-cost path analysis. The integrated technique presented here is applicable to all-terrain vehicle navigation where a continuous raster surface and discrete vector networks need to be considered simultaneously in order to find least-cost paths. This paper describes the concept behind, and details of, the integrated technique. Applications of the technique with synthetic and real-world data sets are also presented. They provide proof that the technique is effective in finding least-cost paths across a continuous raster surface with discrete vector networks.     

基于拓扑关系原理的栅格转换矢量方法的研究

从与传统方法不同的角度着手,以拓扑关系为指导,研究了一种新的由栅格数据转换为矢量数据的方法。与传统转换方法相比,该方法不需对栅格数据进行预处理,它在转换过程中即形成拓扑关系,只需对图像数据逐行处理一次,故适合于大图像的处理。该方法转换效率高、速度快,并在试验中取得了很好的效果。     

改进的边标志栅格化算法

矢量多边形的栅格化算法是地理信息系统的基础算法之一。本文通过分析比较,认为边标志算法于众多栅格化算法中最为适合地理信息系统,并通过简化边界标志过程进行了改进,使得处理流程更为简单清晰,实现更为方便,算法更为精确有效。该改进算法使用统一的相加方法进行边界标志,无需对特殊顶点、尖锐多边形、带岛多边形等进行判断和边界转换,便可一次性正确标志,且无需顾及多边形边的存储顺序,更加适合地理信息系统矢量多边形的数据结构。