折线逼近法在水文遥测数据处理中的应用

水文资料整编是形成水文监测成果的重要环节,随着水文监测的自动化程度越来越高,数据采集量大幅度增长,大量的数据处理成为水文资料整编的一大难题.本文尝试采用"折线逼近法",对水文遥测数据进行精简处理,尽可能地减少摘录数据量,用最少的摘录数据构成的折线来模拟实际水文要素的变化过程,并使其过程不失真,满足规范要求,便于水文年鉴刊印.该方法在江苏省水文遥测数据直接整编程序软件编制过程中得到应用,获得了较好的效果.     

基于Polygon之间相互切割的算法描述与实现

在地理信息系统(GIS)或一些图形处理中,经常会碰到地理图形切割,以及对切割后的数据进行处理。文章主要讨论了由Polygon切割Polygon生成Polygon算法的现实意义,以及如何实现切割后的Polygon自动生成算法的问题。     

Envelope generation and simplification of polylines using Delaunay triangulation

As a basic and significant operator in map generalization, polyline simplification needs to work across scales. Perkal’s ε-circle rolling approach, in which a circle with diameter ε is rolled on both sides of the polyline so that the small bend features can be detected and removed, is considered as one of the few scale-driven solutions. However, the envelope computation, which is a key part of this method, has been difficult to implement. Here, we present a computational method that implements Perkal’s proposal. To simulate the effects of a rolling circle, Delaunay triangulation is used to detect bend features and further to construct the envelope structure around a polyline. Then, different connection methods within the enveloping area are provided to output the abstracted result, and a strategy to determine the best connection method is explored. Experiments with real land-use polygon data are implemented, and comparison with other algorithms is discussed. In addition to the scale-specificity inherited from Perkal’s proposal, the results show that the proposed algorithm can preserve the main shape of the polyline and meet the area-maintaining constraint during large-scale change. This algorithm is also free from self-intersection.     

一种抗等角投影变换矢量地图数据水印机制

投影变换攻击是针对矢量地图数据水印的一种常见攻击方式,目前大多数水印算法都无法有效抵抗投影变换攻击。通过研究投影变换和矢量地图数据的特点,设计了一种折线变换方案,该方案是将折线由点坐标表示方式转化为距离和角度的表示方式,通过对转换后的角度系数嵌入水印,能够有效抵抗等角投影变换攻击。通过实验验证,该算法是可行的,且具有良好的不可见性和抗等角投影攻击的鲁棒性。     

Star and polyline glyphs in a grid plot and on a map display: which perform better?

Glyphs are small geometric shapes that in geovisualization are often used to represent multidimensional spatial data. The aim of this study is to investigate the effectiveness of their two types – star and polyline glyphs, as they can encode the same message and can provide similar functionality. Thus, if the two glyph types are similar and can be used for the same data, the question arises as to which of them better facilitates various user tasks. To address this question, an empirical study of 26 individual users is conducted to investigate differences in user performance for polyline and star glyphs shown either in a grid plot or on a map display. In this study, a task-based approach with eye-tracking is applied, as well as a subjective questionnaire and a psychological test of cognitive style. The finding is that polyline glyphs better facilitate tasks when datapoint values in glyphs are to be read, whereas star glyphs are better when a visual search among glyphs is to be done. Moreover, the results reveal that the map display works better than the grid plot. If star glyphs are to be used, the key (legend) needs to be better incorporated into a visual interface.     

基于离散傅里叶变换的线要素节点压缩方法

相较于传统删减顶点的线要素综合方法,基于傅里叶变换的线要素综合更能保留曲线的全局特征,但现有的傅里叶综合方法无法自动减少和控制点数,更多适用于曲线的平滑及多尺度表达。因此本文提出一种利用离散傅里叶变换进行线要素综合的方法。对曲线进行离散傅里叶变换,获得有限项傅里叶描述子;根据期望的压缩比对傅里叶描述子进行截断;根据截断后的描述子项进行离散傅里叶逆变换获得化简曲线。本文提出的这种傅里叶方法能够减少化简后曲线顶点数,适用于地图综合领域。本文通过四组实验验证了算法的可行性,展示其如下优点：① 能够在相应尺度上对线性地物进行平滑、渐进的化简和表达② 在现有傅里叶变换法的基础上能够保留曲线原顶点;③ 以顶点数作为综合过程参数,能够自动减少曲线顶点数;④ 相较于传统节点压缩方法,更注重整体形态的化简,在综合过程中能更好地保留曲线的整体特征;⑤ 在转换尺度较大的综合过程中,相较于传统节点压缩方法所保留的几何精度更高。     

基于ArcGIS Objects的带状图生成算法研究

带状图具有折点难处理、生成算法复杂等特点,是城市地下管线信息系统建设的难点之一。本文提出了一种通过计算带状图图幅顶点坐标以生成带状图的方法,并对折线、折点处理进行了重点阐述,简单介绍了带状图的打印出图,最后利用ArcGIS Object平台与C#编程实现了地下管线数据带状图生成的实验验证。     

Split-Match-Aggregate (SMA) algorithm: integrating sidewalk data with transportation network data in GIS

Sidewalk geodata are essential to understand walking behavior. However, such geodata are scarce, only available at the local jurisdiction and not at the regional level. If they exist, the data are stored in geometric representational formats without network characteristics such as sidewalk connectivity and completeness. This article presents the Split-Match-Aggregate (SMA) algorithm, which automatically conflates sidewalk information from secondary geometric sidewalk data to existing street network data. The algorithm uses three parameters to determine geometric relationships between sidewalk and street segments: the distance between streets and sidewalk segments; the angle between sidewalk and street segments; and the difference between the lengths of matched sidewalk and street segments. The SMA algorithm was applied in urban King County, WA, to 13 jurisdictions’ secondary sidewalk geodata. Parameter values were determined based on agreement rates between results obtained from 72 pre-specified parameter combinations and those of a trained geographic information systems (GIS) analyst using a randomly selected 5% of the 79,928 street segments as a parameter-development sample. The algorithm performed best when the distances between sidewalk and street segments were 12 m or less, their angles were 25° or less, and the tolerance was set to 18 m, showing an excellent agreement rate of 96.5%. The SMA algorithm was applied to classify sidewalks in the entire study area and it successfully updated sidewalk coverage information on the existing regional-level street network data. The algorithm can be applied for conflating attributes between associated, but geometrically misaligned line data sets in GIS.     

走滑断层震间形变GPS观测站点布设的合理性分析

针对单条断层合理布设GPS站点可准确反映断层形变状态。 远场布设的有效距离与近场的布设间隔是影响断层运动分析结果的重要因素。 远场有效距离为变形宽度的边界, 其与断层闭锁深度之间的关系约为6.31倍; 近场间隔利用分段折线近似替代断层震间形变曲线, 根据形变曲线的变化特点将形变区域分区, 得到“近场区”和“过渡区”与断层闭锁深度之间的关系。 并且, 对川滇块体东边界目前站点布设状态对结果可能的影响进行初步分析。 研究结果可对今后GPS站点布设方案提供理论参考。     

线对象的惯性函数描述与三角剖分方法

现有线对象三角剖分算法没有顾及线对象的整体结构特征,导致三角剖分质量不高,难以支持大数据量的矢量制图和高更新率的动态制图。本文提出线对象的惯性函数,设计了一种线对象的单调分解与三角剖分方法。惯性函数的单调递增区间作为线对象的渐变区间,连续剖分为一个优化的三角形条带;惯性函数的单调递减区间作为线对象的突变区间,离散剖分为一个优化的三角形扇。试验表明:本文方法三角剖分的顶点、三角形、图元的个数均优于基于顶点和基于线段的三角剖分方法,能够显著提升线对象的绘制效率。本文方法也适用于封闭线型、宽度渐变线型与光滑线型。