地质图空间数据库建设中的拓扑关系处理

拓扑关系是空间数据库的核心。主要阐述拓扑关系的基本概念，详细介绍MAPGIS和ARC/INFO两大模块中，拓扑关系具体表现形式、处理方法及处理过程中的注意事项，形成了一套较为完善的工作流程，提高了工作效率，为今后的信息化提供了行之有效的工作方法。     

采用网络分区与预计算策略的k近邻查询算法

k近邻查询是GIS和空间数据库等领域的研究热点.文章针对道路网络中的k近邻查询,通过分区以及预计算近邻集策略,获得查询点的k近邻结果:首先利用自适应格网分区方法将道路网络划分为若干格网单元,并存储格网内节点与边界点、边界点之间距离;其次在网络中的节点预先存储近邻集.实验证明,在兴趣点密度高、k值较大情况下,算法具有较好的性能.     

关于数直线R中分划R的子集

本文研究美国学者P.Bankston和R.J.McGovern提出的一个公开问题—数直线R中那些子集分划R?研究表明,R中的每一个0一维子集都分划R;对月中的1一维子集;本文给出了开集、闭集以及具有某种散性的子集分划R的充分必要条件。     

大气流场的拓扑结构

用简化的大气运动方程,定性分析了大气中几种常见天气系统流场的拓扑结构. 研究表明,气旋反气旋流场与中心点附近的流形相对应;长波演化形成阻塞高压流场,与鞍点和中心点从合并到分离的流形相对应;台风和龙卷风的流场与三维空间中鞍-焦点附近的流形相对应. 研究大气流场的拓扑结构,可以直观清晰地揭示大气运动的形态和形成机理,有助于认识大气运动的规律. 文中讨论基于一定假设,结果与实际大气有差异,因而具有局限性.     

Watermarking of digital geospatial datasets: a review of technical,legal and copyright issues

Gathering data accounts for more than 80% of the cost of any GIS project. Fast Internet connections and digital datasets threaten the investments of data producers through data piracy. Outside the GIS community this problem has been known for a long time, and possible solutions exist for digital imagery, formatted text, 3D meshes and so on, showing possible links to typical spatial data. This is largely achieved through embedding hidden information in a dataset without producing perceptible changes in the data, a process known as watermarking. The producer can recover the embedded information on request in order to produce evidence of ownership in a court, so the overall strategy relies on a legal basis rather than technical ones. This paper analyses the state-of-the-art for watermarking protection in digital geographical datasets. Digital imagery is demonstrably a more mature area than geographical information, even with multiple commercial vendors offering watermarking protection. 2D vector and point datasets have received less attention from the research community; however, 3D meshes have been considered by the CAD community and a handful of techniques are available for that case, and they are reviewed here.     

GIS and remote sensing integration for environmental applications

Abstract

The combined use of remotely-sensed images and vector GIS data has received considerable interest in recent years. This review article discusses the historical move towards closer integration of remote sensing and GIS technologies and the requirements of integrated software systems to enable remotely-sensed data to be combined with vector datasets for maximum effect. The benefits of integration to users of both GIS and remote sensing for environmental applications are reviewed and some thoughts are given on terminology and future directions in this field.     

Ranking spaces for predicting human movement in an urban environment

A city can be topologically represented as a connectivity graph, consisting of nodes representing individual spaces and links if the corresponding spaces are intersected. It turns out in the space syntax literature that some defined topological metrics can capture human movement rates in individual spaces. In other words, the topological metrics are significantly correlated to human movement rates, and individual spaces can be ranked by the metrics for predicting human movement. However, this correlation has never been well justified. In this paper, we study the same issue by applying the weighted PageRank algorithm to the connectivity graph or space–space topology for ranking the individual spaces, and find surprisingly that: (1) the PageRank scores are better correlated to human movement rates than the space syntax metrics, and (2) the underlying space–space topology demonstrates small world and scale free properties. The findings provide a novel justification as to why space syntax, or topological analysis in general, can be used to predict human movement. We further conjecture that this kind of analysis is no more than predicting a drunkard's walking on a small world and scale free network.     

Modeling the scale dependences of topological relations between lines and regions induced by reduction of attributes

The scale dependences of topological relations are caused by the changes of spatial objects at different scales, which are induced by the reduction of attributes. Generally, the detailed partitions and multi-scale attributes are stored in spatial databases, while the coarse partitions are not. Consequently, the detailed topological relations can be computed and regarded as known information, while the coarse relations stay unknown. However, many applications (e.g., multi-scale spatial data query) need to deal with the topological relations at multiple scales. In this study new methods are proposed to model and derive the scale dependences of topological relations between lines and multi-scale region partitions. The scale dependences of topological relations are modeled and used to derive the relations between lines and coarse partitions from the relations about the detailed partitions. The derivation can be performed in two steps. At the first step, the topological dependences between a line and two meeting, covered and contained regions are computed and stored into composition tables, respectively. At the second step, a graph is used to represent the neighboring relations among the regions in a detailed partition. The scale dependences and detailed relations are then used to derive topological relations at the coarse level. Our methods can also be extended to handle the scale dependences of relations about disconnected regions, or the combinations of connected and disconnected regions. Because our methods use the scale dependences to derive relations at the coarse level, rather than generating coarse partition and computing the relations with geometric information, they are more efficient to support scale-dependent applications.     

A combinatorial data model for representing topological relations among 3D geographical features in micro‐spatial environments

This research is motivated by the need for 3D GIS data models that allow for 3D spatial query, analysis and visualization of the subunits and internal network structure of ‘micro‐spatial environments’ (the 3D spatial structure within buildings). It explores a new way of representing the topological relationships among 3D geographical features such as buildings and their internal partitions or subunits. The 3D topological data model is called the combinatorial data model (CDM). It is a logical data model that simplifies and abstracts the complex topological relationships among 3D features through a hierarchical network structure called the node‐relation structure (NRS). This logical network structure is abstracted by using the property of Poincaré duality. It is modelled and presented in the paper using graph‐theoretic formalisms. The model was implemented with real data for evaluating its effectiveness for performing 3D spatial queries and visualization.     

全国地震通信网络系统建设中的若干技术问题

系统描述了全国地震通信网络系统构成和拓扑结构,简要介绍了在项目建设中遇到的一些关键技术问题,主要包括: 分组交换网(X.25)和路由器在联网中的应用;防火墙技术在全国地震通信网络中的应用;网络流量控制和记帐;域名管理和设置。