共查询到20条相似文献，搜索用时 46 毫秒
1.
本文介绍一种最近由作者在美国研制的,由计算机产生等距离区域分界线的程序及其数据结构,同时给出初步的试验结果。 相似文献
2.
3.
基于 Markov 理论的加权非等距GM（1，1）预测优化模型 总被引：1，自引：0，他引：1
背景值的构造方法是影响加权非等距GM(1,1)预测模型的精度和适应性的关键因素。文中通过等分函数法构造新的背景值对传统的加权非等距GM(1,1)模型进行优化,优化后的模型使其同时适应于高增长指数序列和低增长指数序列,提高传统模型的预测精度和适应性能力。但是优化后的模型依然易受建模数据随机扰动影响。马尔科夫(Markov)模型具有削弱建模数据的随机扰动性的优势。基于此,将优化的加权非等距GM(1,1)模型和Markov理论有机结合,构建优化的加权非等距Markov-GM(1,1)预测模型。最后,结合秀山湖二期工程的变形实测数据,运用新陈代谢的计算模式进行预测验证。结果表明:优化的加权非等距Markov-GM(1,1)预测模型的拟合和预测精度都优于传统的加权非等距GM(1,1)预测模型,新的预测模型的适用性更强,具有实际的参考价值。 相似文献
4.
研究了极球面投影海图上准确便捷地量测距离的方法。推导了极球面投影下大圆航线和等角航线的方程,形状分析表明极区宜采用大圆航线量测距离;根据极球面投影下直线的几何意义推导了其距离计算公式,距离差值分析表明可用直线代替大圆航线准确量测距离;根据极球面投影上小圆线投影为圆的性质,提出了一种基于等距圆的准确便捷的距离量测方法,以满足极球面投影海图的极区导航应用需要。 相似文献
5.
确定地理网络中心服务范围的一种算法 总被引：7，自引：1，他引：6
地理网络的中心服务范围在实际生活中应用广泛,传统方法一般用等时区或等距区表示。本文给出基于地理网络的中心服务范围的概念,并在邻接结点矩阵的基础上,应用广度优先搜索算法确定一个中心的服务范围。 相似文献
6.
This paper analyzes the advantages and disadvantages of two techni-cal lines for automatic group generalization of contour lines.The author suggeststhat it is possible to get faster and better generalization results if we simulate theintelligence of human experts in program designing,retrieve geomorphologicalstructural information using the input data of 2-D contour lines and derive andoutput the generalied 2-D results directly. 相似文献
7.
A New Method to Correct Pushbroom Hyperspectral Data Using Linear Features and Ground Control Points
《地理信息系统科学与遥感》2013,50(3):416-431
Data acquired using aerial pushbroom scanners often contain aircraft motion errors—especially aircraft roll error. This article describes a new algorithm to correct roll errors using both ground control points and linear features digitized on a reference map and the uncorrected image. The algorithm is different from previous methods used to correct aerial pushbroom data because it does not solely rely on a single or multiple straight lines. Rather, it is able to integrate both points and lines together to correct the error. With an associated loss of precision, it can also use points or lines separately. The method is tested on a hyperspectral dataset acquired in the Range Creek, Utah area during June 2009. It was found that the approach is an effective way to remove aircraft roll errors and prepare the image for additional georegistration. A program with a graphical user interface has been written using the algorithm and is available on the project's website. 相似文献
8.
FEI Lifan 《地球空间信息科学学报》2013,16(1):85-95
ABSTRACT This paper analyzes the advantages and disadvantages of two technical lines for automatic group generalization of contour lines. The author suggests that it is possible to get faster and better generalization results if we simulate the intelligence of human experts in program designing, retrieve geomorphological structural information using the input data of 2-D contour lines and derive and output the generalized 2-D results directly. 相似文献
9.
用GIS进行邻近性分析的方法及应用 总被引：3，自引：0，他引：3
邻近性分析是GIS特有的功能之一,也是GIS相对于其它信息系统的优势之一。邻近分析方法主要应用于研究中心体与周围一定距离的事物之间的关系,这样,可以把比较复杂的问题直观化、科学化,再用GIS的有关数据通过模型分析,得出相当直观的结果,为用户提供较为实用的服务。作者提出了邻近性分析的二种非常简便和实用的方法,并展示了它的应用实例,一种方法是等距缓冲区法及其在城市道路规划中拆迁问题的研究和城市管理中违章建筑问题的研究;另一种方法是等值线法及其在公共设施规划和居住区规划中的应用。用GIS进行邻近性分析真正体现了GIS的“把空间位置数据与属性数据有机地结合起来”,这个突出的特点是其它数据库所不及的。 相似文献
10.
地形图等高线成组综合的试验 总被引：15，自引：0，他引：15
费立凡 《武汉大学学报(信息科学版)》1993,(Z1)
本文在讨论制图自动综合一般问题的基础上,着重分析了两种等高线自动综合的技术路线存在的优缺点。笔者提出,采用模拟人类专家智能的方法,从二维的等高线输入数据出发,提取地貌结构信息,从而对等高线进行成组的综合,直接形成经综合的二维等高线输出数据,有可能获得较为简捷,效果良好的综合结果。在对这条技术路线进行实验的过程中所涉及的人工智能问题,主要包括:对无序数字化等高线数据的整理、等高线上重要特征点的识别、正负向地貌特征的确定、谷地点的选出、谷底线的自动跟踪、谷地重要性的计算、谷间距的自动量算、对称谷地的寻找、综合后图形的生成等。 相似文献
11.
《制图学和地理信息科学》2013,40(4):264-272
This paper reports the results of an in-depth study which investigated two algorithms for line simplification and caricatural generalization (namely, those developed by Douglas and Peucker, and Visvalingam, respectively) in the context of a wider program of research on scale-free mapping. The use of large-scale data for man-designed objects, such as roads, has led to a better understanding of the properties of these algorithms and of their value within the spectrum of scale-free mapping. The Douglas-Peucker algorithm is better at minimal simplification. The large-scale data for roads makes it apparent that Visvalingam's technique is not only capable of removing entire scale-related features, but that it does so in a manner which preserves the shape of retained features. This technique offers some prospects for the construction of scale-free databases since it offers some scope for achieving balanced generalizations of an entire map, consisting of several complex lines. The results also suggest that it may be easier to formulate concepts and strategies for automatic segmentation of in-line features using large-scale road data and Visvalingam's algorithm. In addition, the abstraction of center lines may be facilitated by the inclusion of additional filtering rules with Visvalingam's algorithm. 相似文献
12.
13.
井下平面控制测量网只能以基于支导线的形式沿巷道布设,针对矿山重大贯通工程测量所用的支导线精度满足不了贯通允许偏差的情况,采用陀螺定向技术,研究了井下支导线升级改造的3个方案。首先,加测一条陀螺定向边方案,导线总边数不超过5条时,定向边加测在末边上;否则,定向边由末边开始上移至总边数1/3的位置;其次,加测多条陀螺定向边的多节导线方案,以等距离间隔加测3~4条陀螺定向边为宜;最后,陀螺定向—光电测距导线方案,仅在超长距离或超高精度的矿山贯通工程测量中应用。结合实例计算,升级改造的3个方案与原有支导线比较,导线终点点位精度可依次提高0.5~1.5倍,1.6~4.5倍,3~8倍。 相似文献
14.
In this paper, we propose a method of cost distribution analysis of new consumer connections to a city power grid by accounting for spatial restrictions and characteristics of existing networks. In practice, the calculation of connection costs for each new consumer includes the network design and financial expenditure. We suggest that connection costs should be calculated for the whole city based on the normative parameters at the stage when the object location is selected by investors and when power grid development is planned by power companies. The proposed method enables the modeling of new power line connection routes from every parcel of city land to possible points of connection to the operating networks based on the raster design of the area. The optimal path is chosen by one criterion consisting of two components: the costs of both laying new power lines and providing sufficient power reserve in the chosen network connection point. Realized as a computer program, the method has been used to calculate the costs of connections to low-voltage power lines. 相似文献
15.
国土资源管理信息系统的框架设计研究 总被引：1，自引：0，他引：1
针对国土资源管理的具体要求和特点，提出了一种国土资源管理信息系统的设计方案，介绍了系统的设计原则、内容和主要功能。并通过对图斑的多边形、界址点和界址线的管理，从而实现了国土资源的计算机管理。 相似文献
16.
关于GIS缓冲区的建立问题 总被引：4，自引：0，他引：4
毋河海 《武汉大学学报(信息科学版)》1997,(4)
在对多种方法编程实践的基础上，本文对绘制平行曲线特别是形成缓冲区的两种主要方法（角分线法与圆弧法）进行了分析对比。角分线法带来很多异常情况，连同其补充校正措施，该方法就失去其相对简易性。相反，圆弧法是在强化判断（凸凹判断和弦弧可控逼近）的基础上，最大限度地确保双线的等宽性。文中提出二重数学模型：形成双线的几何算法模型和针对自相交问题的关系处理模型。除了重点对单一目标进行研讨外，文末对具有集合特征的树结构和网结构的缓冲区建立问题也进行了原则性讨论。 相似文献
17.
《The Cartographic journal》2013,50(3):276-285
AbstractTraditionally schematised maps make extensive use of curves. However, automated methods for schematisation are mostly restricted to straight lines. We present a generic framework for topology-preserving curved schematisation that allows a choice of quality measures and curve types. The framework fits a curve to every part of the input. It uses Voronoi diagrams to ensure that curves fitted to disjoint parts do not intersect. The framework then employs a dynamic program to find an optimal schematisation using the fitted curves. Our fully-automated approach does not need critical points or salient features. We illustrate our framework with Bézier curves and circular arcs. 相似文献
18.
卡西欧计算器在坐标计算中的编程应用 总被引：2，自引：0，他引：2
通过分析坐标系转轴换算原理和导线测量坐标计算原理,导出同一坐标系下全曲线各点和法线平行线与切线平行线交点的坐标计算公式。并利用Casiofx-4500p和Casiofx-4800p计算器进行编程,加快了计算速度,并提高了计算精度。 相似文献
19.
《制图学和地理信息科学》2013,40(4):206-228
A scheme for multi-scale geometrical representation of a digital line is proposed. A digital line is represented as a structured object in which lines at different levels of resolution are represented as lists, quadcodes are used as control mechanism for guiding line simplification at multiple scales of a pyramid, and operators for simplification and smoothing are used to generate lines at different levels of resolution. In this scheme, lines at different levels of an image pyramid can be automatically generated without specifying the so-called tolerance value. Experimental results show that up to a certain level of resolution, the simplified lines retain important information content and recognizable characteristics. Also, the image pyramid assures a legible representation at any level of representation. Future research should improve the current line simplification operator and address the correspondence between lines at different levels of an image pyramid and the lines at different map scales. 相似文献
20.
Paulo Raposo 《制图学和地理信息科学》2013,40(5):427-443
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. 相似文献