地图上多边形数据的快速数字化方法

本文针对传统数字化方法速度慢、劳动强度大等缺点,提出了一种利用扫描仪对地图进行扫描,再对扫描图像进行矢量化处理,从而完成多边形类地物的数字化的方法。而对每个多边形,只须在多边形中或附近任意采集一点,即可自动得到全部顶点的坐标。实验表明,该方法不仅可以数十倍地提高作业速度,而且还可较大幅度地提高数字化的精度,同时也大大减轻了作业员的劳动强度。     

三维激光扫描点云数据压缩方法

三维激光扫描获得的点云数据,其数据量比较大,通过分析三维激光扫描数据的特点,本文提出了两个数据压缩方法,分别为区域重心数据压缩法和基于三维TIN数据的共顶点数据压缩法,介绍了两种数据压缩方法的原理和实现过程,并对区域重心数据压缩法进行实例分析,得出了压缩结果。     

基于顶点单位法向量法的模型简化算法研究

提出了改进的基于顶点视觉重要度的模型简化算法,该简化算法在顶点视觉重要度的计算中采用了顶点单位法向量法,目的是使处于平面内的顶点优先进行简化,从而使模型视觉尖锐的地方得到了很好的保持。在边折叠时,采用狭长三角形最大最小角方法及边角和法,增加模型的逼真性。最后,通过与QEM简化算法比较得出,本文简化算法较好地保持了模型的视觉特征,模型数据存储量也有大幅度减少,并缩短了简化时间。     

Scale-specific automated line simplification by vertex clustering on a hexagonal tessellation

A new method of cartographic line simplification is presented. Regular hexagonal tessellations are used to sample lines for simplification, where hexagon width, reflecting sampling fidelity, is varied in proportion to target scale and drawing resolution. Tesserae constitute loci at which new sets of vertices are defined by vertex clustering quantization, and these vertices are used to compose simplified lines retaining only visually resolvable detail at target scale. Hexagon scaling is informed by the Nyquist–Shannon sampling theorem. The hexagonal quantization algorithm is also compared to an implementation of the Li–Openshaw raster-vector algorithm, which undertakes a similar process using square raster cells. Lines produced by either algorithm using like tessera widths are compared for fidelity to the original line in two ways: Hausdorff distances to the original lines are statistically analyzed, and simplified lines are presented against input lines for visual inspection. Results show that hexagonal quantization offers advantages over square tessellations for vertex clustering line simplification in that simplified lines are significantly less displaced from input lines. Visual inspection suggests lines produced by hexagonal quantization retain informative geographical shapes for greater differences in scale than do those produced by quantization in square cells. This study yields a scale-specific cartographic line simplification algorithm, following Li and Openshaw's natural principle, which is readily applicable to cartographic linework. Open-source Java code implementing the hexagonal quantization algorithm is available online.     

Parallel algorithm for viewshed analysis on a modern GPU

Spatial analysis, including viewshed analysis, is an important aspect of the Digital Earth system. Viewshed analysis is usually performed on a large scale, so efficiency is important in any Digital Earth application making these calculations. In this paper, a real-time algorithm for viewshed analysis in 3D scenes is presented by using the parallel computing capabilities of a graphics processing unit (GPU). In contrast to traditional algorithms based on line-of-sight, this algorithm runs completely within the programmable 3D visualization pipeline to render 3D terrains with viewshed analysis. The most important difference is its integration of the viewshed calculation with the rendering module. Invisible areas are rendered as shadows in the 3D scene. The algorithm process is paralleled by rasterizer units in the graphics card and by vertex and pixel shaders executed on the GPU. We have implemented this method in our 3D Digital Earth system with the DirectX 9.0c API and tested on some consumer-level PC platforms with interactive frame-rates and high image quality. Our algorithm has been widely used in related systems based on Digital Earth.     

矢量面状要素几何相似性度量方法探讨

针对GIS面状要素由于具有旋转、平移、缩放等形状不变特性而导致相似性度量困难的问题,该文提出了完整的几何相似性度量模型:采用基于顶点中间度的轮廓特征点提取方法,能够在较小误差情况下充分表达原始图形,从而提高相似度计算效率;通过傅里叶描述方法对轮廓进行数学表达,截取能表达图形的前n阶因子,利用向量夹角余弦值理论度量归一化傅里叶描述子向量的相似度,顾及了图形的几何变换不变性。实验结果表明,该描述模型可有效地对GIS面状要素的几何相似性进行度量。     

GIS中的测地距离及其求取方法

在利用ＧＩＳ进行空间分析的过程中，常常会遇到求取某一连通域内两点间最短路径和相应的距离这类问题，传统上使用的欧氏距离对此有较大的局限性。本文把测地距离的概念引入到矢量型ＧＩＳ中，并讨论了测地距离的若干性质；在此基础上，提出了一种简便有效的求取矢量型ＧＩＳ中两点间测地距离的方法，并编写了相应的程序。实际应用表明文中所提出的方法是切实可行的，有效地克服了欧氏距离的局限性。     

Scale-free Structure of Town Road Network in Southern Jiangsu Province of China

From the viewpoint of Graph Theory this paper builds a town road network graph of regional scale, and proposes numerical vertex degree (Di), rank vertex degree (Dr) and population size vertex degree (Dp) on the base of vertex degree (D). Then the indicators of Di, Dr, Dp and mathematical statistics methods are applied to investigating scale-free structure of town road networks in the southern Jiangsu Province. The results show that the distribution of Di does not exhibit scale-free properties, but Dr and Dp do. Additionally the correlation coefficient between Dp and Di is only 0.569, but the spatial correlation between Dp and Dr is very evident on the base of correlation analysis and spatial analysis of GIS. The mutual mechanism between Dp and Dr spatially represents a "Core-Belt" model of town development of regional scale. The town development model is open and clustered, and beneficial to both economic development and ecological protection. And then we suggest that Suzhou City, Wuxi City, Changzhou City and Wujin City control towns' high-density pattern by conducting centralization and consolidation policies, and properly controlling and planning higher rank roads; whereas Nanjing City, Zhenjiang City, Jintan City and Liyang City must strengthen the development of towns along higher rank roads.     

Delaunay三角形法实现面状要素自动注记初探

地图自动注记是自动制图技术的重要环节之一。本文阐述了根据Delaunay三角形的逐点自动生成算法原理进行面状要素自动注记的方法。重点论述了图斑多边形的预处理算法和求取注记定位线的算法。在与长对角线法和水平切割中点线法相比后证明,这种算法不但能够处理所有常规形状的多边形,而且能够适应诸如凹形多边形等具有特殊形状的多边形。