共查询到18条相似文献，搜索用时 125 毫秒
1.
基于Qi(xi,yi)函数的辐射线空间分割与TIN的约束边镶嵌 总被引：1，自引：0，他引：1
提出了一个基于Qi(xi，yi)函数的辐射线空间分割方法来实现约束边的镶嵌。时间复杂度的分析表明，执行Qi(xi，yi)函数的时间复杂度比计算点到直线的距离低．提出的算法比基于距离的空间分割算法在时间效率上具有优势。 相似文献
2.
李伟生 《武汉大学学报(信息科学版)》1997,(2)
为了适应实时ＧＩＳ的变比例尺显示与网络ＧＩＳ的快速矢量数据传输，提出了数字地图的在线综合概念，讨论了对线目标的在线简化算法。提出的两个在线简化算法都是对ＤＰ简化算法进行改造，使算法对时间的复杂度从θ（ｎ）～θ（ｎ２）的乘法运算改进为θ（１）～θ（ｎ）的赋值运算，并讨论了减少算法所涉及的空间复杂度的可能性 相似文献
3.
矢量电子地图的线目标在线简化 总被引：5，自引：0，他引：5
李伟生 《武汉测绘科技大学学报》1997,22(2):146-150
为了适应实时ＧＩＳ的变化比例尺显示与网络ＧＩＳ的快速矢量数据传输，提出了数字地图的在线综合概念，讨论了对线目标的在线简化算法。提出的两个在线简化算法都是对ＤＰ简化算法进行改造，使算法对时间的复杂度从θ（ｎ）￣θ（ｎ＾２）的乘法运算改进为θ（１）￣θ（ｎ）的赋值算，并讨论了减少算法所涉及的空间复杂度的可能性。 相似文献
4.
通过分析传统的Prim算法及其数据结构与实现方法,本文提出了一种基于边存储结构和AE的改进Prim算法.改进算法优化并降低了原算法的时间复杂度与空间复杂度,提高了算法的运行效率,并应用于某城市交通网络的最优生成树(MST)的建立,实验分析证明了改进的算法更加适用于GIS海量数据的连通性分析与实现. 相似文献
5.
6.
基于扩展集合操作的频繁项集挖掘算法研究 总被引：2，自引：0，他引：2
对传统集合操作进行了扩展，提出了基于扩展集合操作的最大频繁项集生成算法FIS-ES，并从理论上对算法的复杂度进行了详细的分析。实验表明，在最小支持度较小的情况下，FIS-ES算法比Apriori算法具有更快的挖掘速度、更少的空间占用等优点，与Apriori有很好的互补性。 相似文献
7.
线要素化简算法的时间复杂度分析 总被引：1，自引：0，他引：1
线状要素是地图中数量最大、要素类型最多样的要素,其化简在地图自动综合中占据了重要的地位.目前对线状要素化简算法的改进、化简质量、化简精度等方面的研究较多,对线状要素化简算法的效率研究较少.此处是在兼顾化简质量的前提下研究算法效率,通过分析化简算法约束参数的特征,将线状要素化简算法分为6类,选取其中的几个典型算法,分析了其时间复杂度,并按照线状要素化简算法的时间复杂度将其分为线性算法和非线性算法两类,初步探讨了适合这两类算法的并行计算方法. 相似文献
8.
提出了一种基于矩阵块分解的光束法平差快速计算方法,并分析了该算法的时间复杂度和空间复杂度。试验结果表明该算法是可靠有效的。 相似文献
9.
针对贝叶斯室内定位技术存在定位精度低及时间复杂度较高的问题，提出了一种基于高斯混合模型和密度聚类(GMM-DBC)的信道状态信息(CSI)定位算法.通过对分模型参数的初次估计构建GMM概率分布模型并进行误差计算；引入确定分模型个数(DSM)策略，结合误差计算结果更新GMM模型参数，减小由模型精度引起的定位误差；基于不同参考点的分布特征，判断参考点间紧密程度，将紧密相连的参考点划为一类，减小搜索范围，降低时间复杂度；根据分簇结果，利用改进的贝叶斯概率算法进行权值计算，得到最终定位结果.实验结果表明：所提算法能较好地提高定位精度，降低时间复杂度. 相似文献
10.
快速近似主成分分析算法 总被引：2，自引：0，他引：2
通过分析现有主成分分析算法的不足,研究了如何利用小波包算法实现快速近似主成分分析算法的问题,并对两种算法的复杂度进行了比较。实验结果表明：提出的快速近似主成分分析算法在精度和速度两个方面都具有明显的优势。 相似文献
11.
在对拓拟邻接凸多边形方向关系计算特殊性分析的基础上，提出了一个邻接凸多边形方向关系计算法和二维空间方向关系推理方法。与Voronoi图所表达的邻近拓扑关系相结合，该算法可以用于计算离散二维空间目标之间的方向关系。 相似文献
12.
一种顾及空间关系约束的线化简算法 总被引：1，自引：1，他引：0
线要素化简在制图表达与综合领域一直是研究的热点和难点之一。然而,经典化简算法多针对单独线要素进行处理,缺乏对该线要素与周边线要素之间整体空间关系的考虑,并且,存在计算结果生硬(D-P算法)、局部极值点缺失,特别是在曲度较大之处出现相交异常(L-O算法)等问题。为此,本文提出一种顾及空间关系约束的线化简算法,建立线要素全局化简方法(LGSM)和矢量位移、面积位移等5类评价指标。采用等高线、河流和道路3类线要素实际数据进行了试验,充分检验了本文算法的优越性,其处理结果符合开方根模型规律,降低了曲线复杂度,在保证全局空间关系不变条件下,不仅更好地保持了曲线整体形状特征,而且光滑美观、精度高。 相似文献
13.
介绍了一种新的R树批生成算法ATBL。本算法结合了自底向上的生成方式和以缓冲区树为基础的自顶向下方式的优点，通过对算法性能进行理论分析以及与其他多个算法进行比较研究，证明该算法在执行速度和所生成R树的查询性能方面都能达到令人满意的效果。 相似文献
14.
Choropleth map animation is widely used to show the development of spatial processes over time. Although animation congruently depicts change, the rapid succession of complex map scenes easily exceeds the human cognitive capacity, causing map users to miss important information. Hence, a reduction of the visual complexity of map animations is desirable. This article builds on research related to complexity reduction of static choropleth maps. It proposes value generalization of choropleth time-series data in space and time, by using a method that adapts to the degree of global spatiotemporal autocorrelation within the dataset. A combination with upstream algorithms for local outlier detection results in less complex map animations focusing on large-scale patterns while still preserving significant local deviations in space and time. An according software application allows for in-depth exploration of the spatial and temporal autocorrelation structures in time-series data and provides control over the whole process of generalization. 相似文献
15.
ADCN: An anisotropic density‐based clustering algorithm for discovering spatial point patterns with noise 
下载免费PDF全文
下载免费PDF全文 Density‐based clustering algorithms such as DBSCAN have been widely used for spatial knowledge discovery as they offer several key advantages compared with other clustering algorithms. They can discover clusters with arbitrary shapes, are robust to noise, and do not require prior knowledge (or estimation) of the number of clusters. The idea of using a scan circle centered at each point with a search radius Eps to find at least MinPts points as a criterion for deriving local density is easily understandable and sufficient for exploring isotropic spatial point patterns. However, there are many cases that cannot be adequately captured this way, particularly if they involve linear features or shapes with a continuously changing density, such as a spiral. In such cases, DBSCAN tends to either create an increasing number of small clusters or add noise points into large clusters. Therefore, in this article, we propose a novel anisotropic density‐based clustering algorithm (ADCN). To motivate our work, we introduce synthetic and real‐world cases that cannot be handled sufficiently by DBSCAN (or OPTICS). We then present our clustering algorithm and test it with a wide range of cases. We demonstrate that our algorithm can perform equally as well as DBSCAN in cases that do not benefit explicitly from an anisotropic perspective, and that it outperforms DBSCAN in cases that do. Finally, we show that our approach has the same time complexity as DBSCAN and OPTICS, namely O(n log n) when using a spatial index and O(n2) otherwise. We provide an implementation and test the runtime over multiple cases. 相似文献
16.
In mountainous regions, solar radiation exhibits a strong spatial heterogeneity due to terrain shading effects. Terrain shading algorithms based on digital elevation models can be categorized into two types: area‐based and point‐specific. In this article, we evaluated two shading algorithms using designed mathematic surfaces. Theoretical shading effects over four Gauss synthetic surfaces were calculated and used to evaluate the terrain shading algorithms. We evaluated the area‐based terrain shading algorithm, Hillshade tool of ArcGIS, and the point‐specific shading algorithm from Solar Analyst (SA) in ArcGIS. Both algorithms showed shading overestimation, and Hillshade showed more accuracy with a mean absolute error (MAE) of 1.20%, as compared to the MAE of 1.66% of SA. The MAE of Hillshade increases exponentially as the spatial extent of the study area increases because the solar position for all locations on the surface is the same in Hillshade. Consequently, we suggest that the surface should be divided into more tiles in Hillshade when the discrepancy in the latitude of the whole surface is greater than 4°. Skyshed, which represents the horizon angle distribution in SA, is error‐prone over more complex terrain because horizon angle interpolation is problematic for such areas. We also propose a new terrain shading algorithm, with solar positions calculated using local latitude for each cell and the horizon angle calculated for every specific time interval, but without projections. The new model performs better than Hillshade and SA with an MAE of 0.55%. 相似文献
17.
18.
Kelsey E. MacCormack Jason J. Brodeur Carolyn H. Eyles 《Journal of Geographical Systems》2013,15(1):71-88
Testing the accuracy of 3D modelling algorithms used for geological applications is extremely difficult as model results cannot be easily validated. This paper presents a new approach to evaluate the effectiveness of common interpolation algorithms used in 3D subsurface modelling, utilizing four synthetic grids to represent subsurface environments of varying geological complexity. The four grids are modelled with Inverse Distance Weighting and Ordinary Kriging, using data extracted from the synthetic grids in different spatial distribution patterns (regular, random, clustered and sparse), and with different numbers of data points (100, 256, 676 and 1,600). Utilizing synthetic grids for this evaluation allows quantitative statistical assessment of the accuracy of both interpolation algorithms in a variety of sampling conditions. Data distribution proved to be an important factor; as in many geological situations, relatively small numbers of randomly distributed data points can generate more accurate 3D models than larger amounts of clustered data. This study provides insight for optimizing the quantity and distribution of data required to accurately and cost-effectively interpolate subsurface units of varying complexity. 相似文献