共查询到20条相似文献，搜索用时 46 毫秒
1.
2.
现有线对象三角剖分算法没有顾及线对象的整体结构特征,导致三角剖分质量不高,难以支持大数据量的矢量制图和高更新率的动态制图。本文提出线对象的惯性函数,设计了一种线对象的单调分解与三角剖分方法。惯性函数的单调递增区间作为线对象的渐变区间,连续剖分为一个优化的三角形条带;惯性函数的单调递减区间作为线对象的突变区间,离散剖分为一个优化的三角形扇。试验表明:本文方法三角剖分的顶点、三角形、图元的个数均优于基于顶点和基于线段的三角剖分方法,能够显著提升线对象的绘制效率。本文方法也适用于封闭线型、宽度渐变线型与光滑线型。 相似文献
3.
none 《The Cartographic journal》2013,50(2):136-145
AbstractTo enhance the variety of map symbols and to develop new symbol types, a fundamental understanding of the map symbol construction process is mandatory. Current construction theories focus on diagrams without taking georeferencing or interactivity into account. This paper presents a new methodology for the creation of two-dimensional geometric symbols and diagrams for the application in thematic maps. In this context, 49 diagrams found in cartographic literature were analysed and classified regarding their construction properties. As a result of this research, diagrams can be defined using cartographic primitives which are arranged according to six arrangement principles. Since the variation of the primitive's size according to the data values follows a certain geometric direction, each diagram can be explicitly defined based on the three construction properties 'primitive', 'arrangement principle' and 'data direction'. 相似文献
4.
在自动制图综合中,面要素聚合较为常用的方法是利用聚类方法将面要素聚类为若干个类簇,进而将每个类簇合并为更大的多边形图斑。针对地图制图领域的前沿研究课题——地图自动综合,该文提出了一种基于滚球法的面状要素聚合的新方法,通过实验阐述了该方法在居民地等面要素综合中的应用,并与传统的聚合算法进行了效率上的对比分析。该方法较传统的聚合方法效率上有很大提高,在大数据量聚合中有一定的应用前景,当选择合适的滚球半径进行综合时,有较理想的结果。 相似文献
5.
《ISPRS Journal of Photogrammetry and Remote Sensing》2000,55(3):139-149
When we map an area or create a digital database for it, the first task is often to partition the space into smaller units. There are traditionally two methods of partitioning: vector and raster. A vector partition delineates the boundary of features by polylines while a raster partition subdivides the space into a regular matrix of square or rectangular pixels. These two are complementary methods of subdividing the space either by features or by unconstrained space cells. In the third dimension, they are extended to polyhedra and voxels, respectively. We will argue in this paper that the terms “vector” and “raster” cannot describe all cases of tessellation. With advances in data modelling, variations of the two traditional methods have been developed, such as the representation of a feature by pixels and not by polylines. At present, there is a lack of systematic terminology to describe the various methods of tessellation. In this paper, we will propose a taxonomy for three-dimensional space tessellation. Its essential feature is to distinguish between abstract concepts of tessellation and their encoding methods. We recognise that tessellation of geographic space is carried out in different stages with increasingly precise mathematical meaning. This provides us with an insight into the process of spatial tessellation and a model to systematically describe the various structures. These concepts could form a basis for spatial data models. 相似文献
6.
刘善磊 《测绘与空间地理信息》2017,(12):25-29
图式符号色值和式样的评价是地图制图赛项中的一项重要内容,为提高评价效率,本文提出了一种快速评价方法。首先根据标准数据和对应地图图式进行数据预处理和矢量控制文件的制作;然后通过改进的Harris角点检测算法实现角点检测,并进行特征点匹配和几何校正;最后利用缓冲区分析进行符号色值评价,并基于图像矩理论结合GrabCut算法实现符号式样评价。本项技术成果已应用于地图制图赛项中图式符号的快速评价,在测绘地理信息行业职业技能竞赛中发挥了重要作用。 相似文献
7.
Shipeng Sun 《制图学和地理信息科学》2013,40(3):243-259
ABSTRACTMapping spatial flow remains a challenge despite noticeable progress in recent years. This article presents a new, automated layout algorithm for spatial flow from one origin to multiple destinations. The algorithm triangulates the mapped space and builds a network from the triangles. It then simulates the formation of the dendritic drainage pattern of natural river systems and constructs an approximate Steiner tree by sequentially computing the shortest paths from the origin to the destinations using dynamically decreasing edge costs. A series of automatic cartographic operations, including edge simplification, straightening, smoothing, and rendering, then follow to improve the esthetics of the tree and to produce flow layouts that feature natural clusters and smooth edges. An experimental evaluation using four examples illustrates the effectiveness and adaptability of the algorithm with various spatial and parameter configurations. A quantitative comparison with existing methods on esthetics shows that the new algorithm generally renders destinations farther away from tree edges, which helps improve map readability but at the cost of longer total tree length. Evaluated with a smoothness index that rewards gradual tree splitting and smooth, natural, and straight edges, the proposed algorithm can achieve higher average edge smoothness and avoid the least smooth edges under various parameter settings. 相似文献
8.
一种组合优化的多边形化简方法 总被引：2，自引：0，他引：2
以多边形轮廓为目标 ,依据曲线特征点将其分解为一系列的弯曲特征 ,并对此弯曲特征集实施组合优化 ,将入围弯曲首尾相连 ,即可得到最终的化简结果 相似文献
9.
针对在图像匹配中,传统RANSAC算法在特征点提纯方面效率不高的问题,本文采用空间几何约束算法进行特征点提纯,得到初始匹配点集,再通过RANSAC算法进行特征点精确提纯。实验结果表明:该方法在保证较高精度和鲁棒性的前提下,能有效提高RANSAC算法的时间效率,提高图像的拼接精度和速度。 相似文献
10.
11.
针对传统的建筑物化简算法无法准确保持建筑物局部细节几何特征，容易产生尖锐凸角等问题，提出了一种基于邻近五点的建筑物多边形化简方法。通过将多边形边界上的邻近五点定义为基本处理单元，实现对建筑物边界Z形平行、Z形不平行、U形平行、U形不平行的4类几何模式划分，进行渐进式化简，并针对化简过程中产生的尖角顾及角度约束对其削尖。对某地区部分1：1万实际建筑物多边形数据进行试验，结果表明，所提算法在保持建筑物基本几何形态特征的基础上，能够尽可能地避免尖角的产生，化简结果更加符合人类的视觉认知。 相似文献
12.
This paper proposes an automatic method for registering terrestrial laser scans in terms of robustness and accuracy. The proposed method uses spatial curves as matching primitives to overcome the limitations of registration methods based on points, lines, or patches as primitives. These methods often have difficulty finding correspondences between the scanned point clouds of freeform surfaces (e.g., statues, cultural heritage). The proposed method first clusters visually prominent points selected according to their associated geometric curvatures to extract crest lines which describe the shape characteristics of point clouds. Second, a deformation energy model is proposed to measure the shape similarity of these crest lines to select the correct matching-curve pairs. Based on these pairs, good initial orientation parameters can be obtained, resulting in fine registration. Experiments were undertaken to evaluate the robustness and accuracy of the proposed method, demonstrating a reliable and stable solution for accurately registering complex scenes without good initial alignment. 相似文献
13.
14.
《ISPRS Journal of Photogrammetry and Remote Sensing》2000,55(2):75-93
For photogrammetric applications, solutions to camera exterior orientation problem can be classified into linear (direct) and non-linear. Direct solutions are important because of their computational efficiency. Existing linear solutions suffer from lack of robustness and accuracy partially due to the fact that the majority of the methods utilize only one type of geometric entity and their frameworks do not allow simultaneous use of different types of features. Furthermore, the orthonormality constraints are weakly enforced or not enforced at all. We have developed a new analytic linear least-squares framework for determining camera exterior orientation from the simultaneous use of multiple types of geometric features. The technique utilizes 2D/3D correspondences between points, lines, and ellipse–circle pairs. The redundancy provided by different geometric features improves the robustness and accuracy of the least-squares solution. A novel way of approximately imposing orthonormality constraints on the sought rotation matrix within the linear framework is presented. Results from experimental evaluation of the new technique using both synthetic data and real images reveal its improved robustness and accuracy over existing direct methods. 相似文献
15.
Wumeng Huang 《International Journal of Digital Earth》2020,13(9):998-1016
ABSTRACT The scene-rendering mechanism based on binocular vision is one of the key techniques for the VR globe to achieve immersion-type visualization of global 3D scenes. However, this special rendering mechanism also requires that the 3D scene is continuously drawn twice within one frame, which significantly affects the rendering efficiency of VR globes. Therefore, we propose a binocular parallel rendering method. This method first improves the current rendering process of VR globes by assigning the rendering tasks for the left and right camera of VR to be processed on different CPU cores, thereby achieving parallel rendering of binocular scenes. Second, due to the problem of inconsistent resolution of binocular scenes caused by different viewpoints for the left and right cameras, we propose a resolution synchronize algorithm. this algorithm conducts real-time synchronization on the resolution of scene in the rendering process and thus avoids the problem of erroneous binocular stereo matching. Finally, we validate the effectiveness of the method in this paper through experiments. The results of experiments indicate that while the method in this paper can ensure the consistency of binocular scene resolution, it can decrease the frame time of VR globes by approximately 27% on average. 相似文献
16.
《制图学和地理信息科学》2013,40(1):117-128
This paper introduces object space procedures for extracting silhouettes, slope lines, and drainage features from digital elevation models (DEMs) to direct the rendering of landform features in the style of pen-and-ink landscape illustrations. Unlike image space procedures which generally extract feature information through 2-dimensional (2D) rendered image processing techniques, object space procedures operate directly on 3-dimensional (3D) surface models. The ultimate goal of this work is to produce fully automated tools that can imitate the styles characterized by the traditional pen-and-ink techniques of Lobeck, Imhof, Raisz, and other scientific illustrators to bring the beauty of their effective and economical visual techniques to automated cartographic environments. Through the implementation of a Java 3D application programming interface (API) prototype, a testing platform was established for the application of stylistic elements to linework representing surface form lines. This paper explores the aesthetic effects of silhouette lines, creases, and slope lines on the rendering of terrain features. It also introduces the use of adaptively resampled triangulated irregular networks (TINs) as a basis for perspective rendering applications. 相似文献
17.
《International Journal of Digital Earth》2013,6(6):432-449
As a state-of-the-art mapping technology, mobile laser scanning (MLS) is increasingly applied to fields such as digital presentations of city environments. However, its application has recently met a bottleneck in data processing. It has been found that conventional methods for geometrically modeling 3D scattered points are inadequate when dealing with large volumes of MLS data. In fact, this is a challenge that has already been noted in the MLS-relevant fields, e.g. remote sensing, robot perception, and pattern recognition. A variety of algorithms under the schematic frame of analysis, modeling and synthesis (AMS) have been developed in these fields. The AMS paradigm is to first extract the implicit geometric primitives within each scan profile by geometrically modeling its 2D scattered points (GM2P). The resultant 2D geometric primitives are then integrated to restore the real 3D geometrical models. In this process, GM2P is a kernel procedure whereby a review of the GM2P algorithms is assumed to be of significance for developing new efficient algorithms for geometrically modeling 3D scattered points. This idea is supported by MLS sampling often being executed via parallel scan profiles. Indeed, the results of the literature review indicate an avenue for methodologically improving MLS in data processing. 相似文献
18.
多边形点符自动填充是数字地图制图、电子地图制作和 GIS中不可缺少的功能。文中总结了多边形点符填充过程中几种特殊情况的自动判别与处理 ,在此基础上提出了改进的自动点符填充的方法和步骤 相似文献
19.
当前对于涉及两个时期间海岸线蚀退型和淤积型区域的构建研究尚缺乏较为自动准确的方法。将两个时期的海岸线视为有向且无自相交的曲线,相互打断为若干有向折线段。通过总结各类型区域边界的构成规律,提出两时期海岸线间变迁区域的自动构建算法。构成变迁区域边界的海岸线折线段总是两个时期间隔出现,且有相同的起点或终点,移除构成某一变迁区域的所有折线段后,对其他区域的提取没有影响。据此规律,提取某一变迁区域边界上的所有折线段,利用其中的点构建区域,根据早期海岸线的方向,判断变迁区域的具体类型。以实际海岸线数据进行验证实验,结果符合预期。该算法可根据两个时期的海岸线,快速准确地提取出由水域变为陆地的淤积型区域和由陆地变为水域的蚀退型区域,为分析海岸线的时空变化特性提供辅助作用。 相似文献
20.
none 《The Cartographic journal》2013,50(2):153-156
AbstractThere is currently a high demand for spatial data usage within web applications. From a technical viewpoint, web services and geoportals aim to fulfil user requirements; however, the current cartographic methods do not satisfy the needs of the end users. The problem is more challenging when the final map contains data from various sources that have various cartographic characteristics; therefore, the vital information might be located under the base map layer. In this paper, we propose the concept of layer priorities as foreground, middle ground or background, and we propose the two following methods to enhance the symbolisation: polygon overlay and colour saturation methods. The results from two case studies show that these methods can satisfy the requirements of the end users. 相似文献