基于对象关系数据库的时空数据模型研究

一体化时空数据建模是新一代GIS理论与技术研究的重要基础。基于对象关系数据库探讨时空数据库的数据建模方法,提出综合考虑矢量和栅格数据一体化的时空数据模型。首先基于基本类型派生定义矢量和栅格抽象数据类型,在此基础上定义时空数据类型为一系列空间类型的时间片序列。该抽象数据类型的定义包括其数据对象和相关操作,将其嵌入对象关系数据库中,扩展其时空数据的存储和查询能力。利用该数据模型,可以统一考虑矢量和栅格数据,建立基于对象关系的时空数据库,并支持矢量—栅格一体化时空数据访问和操作,进而对新一代GIS技术的研究与实现起到重要支撑作用。     

气候时空数据的样条插值与应用

该文论述了根据1951——2000年中国逐月温度和降水量数据采用样条函数插值实现气候时空数据数字化和可视化扩展的过程。对来自气象站的逐月气候数据利用样条函数插值拟合气候空间曲面，在DEM支持下建立气候变量的空间栅格数据文件，用于GIS对气候变量的查询、成图和二次开发。结果表明插值效果因样本数量、样本空间分布和不同的气候变量会有所不同，较多的样本数量有助于插值质量的提高。由栅格数据文件转换而成的逐月气候图形格式文件可以通过Java编程的浏览器实现气候时空动态变化的直观表达，从而使历史气候数据得到有效扩展、集成和应用。     

矢量数据向栅格数据转换的一种改进算法

地理信息系统的发展与空间数据结构的优化密不可分,栅格数据与矢量数据之间的高效转换是GIS的关键技术之一。由于栅格数据十分有利于空间分析中的叠置分析,因而通常需要将矢量数据转换成栅格数据。该文分析对比了地理信息系统的两种基本数据结构,在总结已往矢量数据转换为栅格数据方法的基础上,依据边界代数多边形填充算法的基本原理,结合绘图作业时采用的正负法,提出了一种改进的折线边界(数据串)跟踪方法。该算法原理简单,不需进行复杂的距离比较运算,运算速度快,并且通过简单的角度判断保证了填充的精度。     

土壤碳库研究中土壤数据从矢量到栅格的等精度转换

矢量数据转换成栅格数据是多数区域土壤碳库研究中数据准备的关键步骤。本研究以太湖地区1:5万、1:50万、1:400万3个比例尺土壤矢量数据库为基础,分别转成不同分辨率的栅格数据;基于不同比例尺和栅格分辨率数据,研究水稻土表层(0～20cm)的土壤类型数量、面积、有机碳储量以及有机碳密度变化,并以矢量数据获得的这4个指标为基准,用相对变异百分数(VIV)来判别不同栅格数据与其对应比例尺土壤矢量数据之间的精度差异。结果表明,在4个指标的|VIV|<1%前提下,3个比例尺矢量数据分别转换成0.2km×0.2km、1km×1km、9km×9km的栅格数据,既保证数据转换过程中精度要求,又避免了数据冗余。土壤数据比例尺与栅格分辨率等精度转换对应关系可描述为y=0.0225x-0.01233(R²=0.999),对区域土壤碳循环研究具有重要参考价值。     

基于Web Geocoding的三维GIS快速定位方法研究

三维GIS技术已经逐渐发展成熟,其对客观世界的表达能给人以更真实的感受,然而三维GIS软件所需数据是海量的。由于遥感技术的发展,纹理数据的获取和处理已经变得容易和快速,而对于矢量数据的采集、存储是一个非常艰巨的工作,如何在短期内获取海量、精确的矢量地理信息数据,减少数据采集的费用和时间成了一大难题。通过基于网络的地理编码来查询获取矢量点状地理信息,将地理信息存储到本地数据库,并且将数据应用到系统中进行快速定位显示,实现地理位置的实时定位和查询,为各种专题三维GIS软件开发提供服务和扩展功能。     

面向问题的空间应用表达与实现

讨论空间应用的一种面向问题的表达方法与实现机制。为解决空间应用的描述问题,在建立时空一体化空间数据模型基础上,定义了对SQL进行扩展的时空复合查询语言,实现了对空间应用问题的非过程化描述;研究复杂空间应用的表达问题,讨论时空复合查询语言的限制,并在语言中引入流机制,通过空间应用问题的组合实现更为复杂的空间应用,并支持空间数据分布式计算;最后给出若干空间应用实例及其面向问题的表达。     

一种基于形状特征的地理实体相似性查询方法

为适应矢量空间数据库的相似性查询的应用需求,提出一种融合区域和边界的形状特征提取算法。通过地理实体的坐标,求解地理实体的质心及离散的旋转角度和质心距离序列,然后等角度间隔重采样,通过线性内插求出所得系列边界点的质心距离,建立质心距离直方图,构造以质心距离直方图、紧凑度和面积的三元组构成的形状特征描述。在此基础上,提出针对矢量空间数据的地理实体相似性查询算法。通过自主开发的GIS空间智能查询与分析平台,以全国1∶25万县市级行政区划矢量数据为数据源,实现了地理实体的相似性查询。实验结果表明,改进图像分析领域的形状分析方法并应用到矢量数据相似性查询领域是可行的,提出的方法可以满足地理实体的相似性查询应用需求。     

矢量空间数据渐进传输研究进展

渐进传输被认为是解决目前海量空间数据传输与实时用户体验之间矛盾的有效方法。栅格数据渐进传输的相关研究比较成熟,但矢量数据的渐进传输理论和技术还存在问题。为了推进矢量数据渐进传输的相关研究,该文对与矢量数据渐进传输密切相关的二维矢量数据、三维表面模型两种数据的多分辨率表达和渐进传输的研究现状进行归纳与总结,指出相关研究的发展方向,为海量空间数据适用于分布式网络传输提供参考依据。     

基于HBase的矢量空间数据存储与查询方法及其应用

研究了HBase存储机制,针对现有存储查询方法效率低等缺陷,设计了HBase矢量空间数据存储表模式,如行键、过滤列族、几何列族及非几何列族等,以MapReduce算法为基础改进了原有的区域查询方法,上述改进有效提高了HBase中矢量空间数据查询效率。以某地近100 a地质灾害数据进行实验,结果表明：设计的存储模型可行,查询算法与传统查询算法相比效率更高;由于MapReduce运行过程中的通信等原因,当数据量小于5万级时,算法优势并不明显;当数据量大于10万级时,算法查询时间低于原来的1/2,而数据量达到100万级时,算法查询时间仅为算法改进前查询时间的1/20。数据量越大,并行化处理优势越明显。     

GIS空间时态数据库系统原型的设计与实现

本文针对地理信息系统中空间时态表达与分析功能的缺陷,设计并实现了一种新的基于矢量多边形系统的空间时态网状数据库模型,对版本进化和新生实体的不同空间时态变化类型提供了多种时态更新算法,并开发了两个系列的空间时态查询语言。     

Structure and contents of a new geomorphological GIS database linked to a geomorphological map — With an example from Liden, central Sweden

This paper presents the structure and contents of a standardised geomorphological GIS database that stores comprehensive scientific geomorphological data and constitutes the basis for processing and extracting spatial thematic data. The geodatabase contains spatial information on morphography/morphometry, hydrography, lithology, genesis, processes and age. A unique characteristic of the GIS geodatabase is that it is constructed in parallel with a new comprehensive geomorphological mapping system designed with GIS applications in mind. This close coupling enables easy digitalisation of the information from the geomorphological map into the GIS database for use in both scientific and practical applications. The selected platform, in which the geomorphological vector, raster and tabular data are stored, is the ESRI Personal geodatabase. Additional data such as an image of the original geomorphological map, DEMs or aerial orthographic images are also included in the database. The structure of the geomorphological database presented in this paper is exemplified for a study site around Liden, central Sweden.     

A heuristic for the maximum value region problem in raster space

From a single-attribute raster layer in which each cell is assigned a numerical value, a connected set of a specified number of cells that has the maximum (or minimum) total value is selected. This is a highly common decision problem in the context of raster-based geographic information systems (GIS) and seems general enough to deserve inclusion in the standard functionality of such systems. Yet it is a computationally difficult optimization problem, for which no efficient exact solution method has been found. This article presents a new dynamic programming-based heuristic method for the problem. Its performance is tested with randomly generated raster layers with various degrees of spatial autocorrelation. Results suggest that the proposed heuristic is a promising alternative to the existing integer programming-based exact method, as it can handle significantly larger raster data with fair accuracy.     

Integration of spatial data in vector and raster formats in a geographic information system environment

This paper examines the common methods for converting spatial data sets between vector and raster formats and presents the results of extensive benchmark testing of these procedures. The tests performed are unique in this field since: (1) they used both synthetic and real test data sets; (2) they measured conversion quality, accuracy and efficiency, not just how fast the procedure operated; and (3) they were conducted in a generic geographic information system (GIS) environment without the aid of specialized computer hardware. The results show that the best overall techniques are the ones which take advantage of spatial relationships inherent in the data sets. These were the Scan Line algorithm for vector to raster conversions and the Boundary Linking algorithm for raster to vector conversions.     

Quadtree storage of vector data†

Abstract

Vector data storage has various advantages in a cartographic or geographical information system (GIS) environment, but lacks internal spatial relationships between individual features. Quadtree structures have been extensively used to store and access raster data. This paper shows how quadtree methods may be adapted for use in spatially indexing vector data. It demonstrates that a vector quadtree stored in floating point representation overcomes the classical problem with raster quadtrees of data approximation. Examples of vector quadtrees applied to realistic size data sets are given     

The GRASS GIS temporal framework

The availability of continental and global-scale spatio-temporal geographical data sets and the requirement to efficiently process, analyse and manage them led to the development of the temporally enabled Geographic Resources Analysis Support System (GRASS GIS). We present the temporal framework that extends GRASS GIS with spatio-temporal capabilities. The framework provides comprehensive functionality to implement a full-featured temporal geographic information system (GIS) based on a combined field and object-based approach. A significantly improved snapshot approach is used to manage spatial fields of raster, three-dimensional raster and vector type in time. The resulting timestamped spatial fields are organised in spatio-temporal fields referred to as space-time data sets. Both types of fields are handled as objects in our framework. The spatio-temporal extent of the objects and related metadata is stored in relational databases, thus providing additional functionalities to perform SQL-based analysis. We present our combined field and object-based approach in detail and show the management, analysis and processing of spatio-temporal data sets with complex spatio-temporal topologies. A key feature is the hierarchical processing of spatio-temporal data ranging from topological analysis of spatio-temporal fields over boolean operations on spatio-temporal extents, to single pixel, voxel and vector feature access. The linear scalability of our approach is demonstrated by handling up to 1,000,000 raster layers in a single space-time data set. We provide several code examples to show the capabilities of the GRASS GIS Temporal Framework and present the spatio-temporal intersection of trajectory data which demonstrates the object-based ability of our framework.     

Bibliography of Journal Articles on Educational Media 1956-1966

Abstract

Many universities are introducing courses to teach students the principles of geographic information systems (GIS). In addition to lectures, exercises with commercial GIS software are offered to show basic operations. Although students learn to execute such operations, the software may hide their internal structure and logic. We propose using a spreadsheet program as a teaching tool for raster operations such as filter and overlay. Spreadsheets offer a practical way to demonstrate and experiment with raster operations, because the raster structure is captured in the form of rows and columns. With this tool, students are able to perform and visualize operations as well as to see how the data are processed by the algorithms. Our approach is new in that we concentrate on the algorithms of operations. We make explicit which raster functions are actually evaluated when performing a particular operation. We conclude that there are good reasons for using spreadsheets in comparison to traditional GIS software when teaching raster operations. These are demonstration in class, simple user interface, familiarity to students, low cost, flexibility of changing cell values, ease of changing parameters, easy programming environment, and the possibility to look behind the scenes of operations by viewing the code.     

高斯两步移动搜索法的模型研究——以上海市绿地可达性为例

合理的配置公共服务设施对城市的现代化建设至关重要。空间可达性是度量公共服务设施配置是否合理的方法之一。在诸多的研究方法中,高斯两步移动搜索法由于直观且运算简便,因而得到广泛应用。但该方法也有不足之处,本文运用格网GIS方法,以上海市的绿地空间可达性为例,对两步移动搜索法进行模型方法的改进研究,并对高斯两步移动搜索法和格网化的高斯两步移动搜索法进行对比分析,结果表明：后者可降低空间可达性的误差,提高可达性精度,对上海市绿地空间可达性反映更加真实、客观。如果选择合理的数据将其格网化,该方法也可以用于其他公共服务设施的空间可达性研究。     

A spatial analytical perspective on geographical information systems

Abstract

The field of geographical information systems (GIS) is reviewed from the viewpoint of spatial analysis which is the key component of the familiar four-part model of input, storage, analysis and output Input is constrained by the limits of manual methods and problems of ambiguity in scanning. The potential for developments in output is seen to be limited to the query mode of GIS operation, and to depend on abandoning the cartographic model. Discussion of storage methods is organized around the raster versus vector debate and the need to represent two spatial dimensions in one. A taxonomy of GIS spatial analysis operations is presented together with a generic data model. Prospects for implementation are discussed and seen to depend on appropriate scales of organization in national and international academic research.