WEB环境下兴趣点抽稀算法改进研究
首发时间:2018-12-20
摘要:兴趣点是web地图表达的重要数据之一,近年来,在GIS大数据背景下,兴趣点的数据量越来越大,导致兴趣点在web地图中显示的时候出现大量重叠压盖的现象,严重影响了web地图显示的性能效率和web地图整体的美观性,为了提高web地图显示的性能效率,同时保持兴趣点在空间分布上的均匀合理性、美观性,本文在介绍目前web端常用的点距离和网格抽稀算法的实现原理以及各自优缺点的基础上,对抽稀算法进行改进,并以福州市区的井盖兴趣点数据为测试样本,对比验证了改进的抽稀算法的可行性,其结论为:相比点距离抽稀算法,改进后的抽稀算法的抽稀效率有明显的提升;相比网格抽稀算法,改进后的抽稀算法抽稀后在web地图上显示的兴趣点信息更加丰富。
For information in English, please click here
A new study on improvement of interest point extraction algorithm in WEB environment
Abstract:Point of interest is one of the important data of web map expression, in recent years, under the background of big data of GIS, the number of points is more and more big, lead to a large number of points overlapping when shows in web map,affect the performance and efficiency of web map display and the overall beauty of web map seriously, in order to improve the performance efficiency of web map display, while keeping the point of interest uniformly and reasonably distributed in space,on the basis of introducing the realization principle of point-distance and the grid-extraction algorithm used in web at present and their respective advantages and disadvantages, this paper improves the extraction algorithm and takes the well cover interest point data of Fuzhou urban area as the test sample. The feasibility of the improved extraction algorithm is verified by comparison. The conclusion is as follows: compared with the point-distance extraction algorithm, the improved extraction algorithm has significantly improved extraction efficiency; Compared with the grid-extraction algorithm, the improved extraction algorithm shows more information on the points of interest on the web map after extracting.
Keywords: Interest points WEB point-distance extraction grid-extraction functional effectiveness
引用
No.****
动态公开评议
共计0人参与
勘误表
WEB环境下兴趣点抽稀算法改进研究
评论
全部评论0/1000