首页 | 本学科首页   官方微博 | 高级检索  
     检索      

线要素化简算法的时间复杂度分析
引用本文:郭立帅,沈婕,朱伟.线要素化简算法的时间复杂度分析[J].测绘科学技术学报,2012,29(3):226-230.
作者姓名:郭立帅  沈婕  朱伟
作者单位:南京师范大学地理科学学院,江苏南京210046;南京师范大学 虚拟地理环境教育部重点实验室,江苏南京210046;南京师范大学 地理信息科学江苏省重点实验室,江苏南京210046
摘    要:线状要素是地图中数量最大、要素类型最多样的要素,其化简在地图自动综合中占据了重要的地位.目前对线状要素化简算法的改进、化简质量、化简精度等方面的研究较多,对线状要素化简算法的效率研究较少.此处是在兼顾化简质量的前提下研究算法效率,通过分析化简算法约束参数的特征,将线状要素化简算法分为6类,选取其中的几个典型算法,分析了其时间复杂度,并按照线状要素化简算法的时间复杂度将其分为线性算法和非线性算法两类,初步探讨了适合这两类算法的并行计算方法.

关 键 词:线要素  化简算法  时间复杂度  约束参数  并行计算

Time Complexity Analysis of Line Simplification Algorithms
GUO Lishuai , SHEN Jie , ZHU Wei.Time Complexity Analysis of Line Simplification Algorithms[J].Journal of Zhengzhou Institute of Surveying and Mapping,2012,29(3):226-230.
Authors:GUO Lishuai  SHEN Jie  ZHU Wei
Institution:1,2,3(1.Institute of Geographic Science,Nanjing Normal University,Nanjing 210046,China; 2.Key Laboratory of Virtual Geographic Environment,Nanjing Normal University, Nanjing 210046,China; 3.Key Laboratory of Geographic Information Science of Jiangsu Province, Nanjing Normal University,Nanjing 210046,China)
Abstract:Liner element is the largest various elements in the map and its simplification is very important in automatic map generalization.There has been a lot of work on the improvement of these algorithms,quality assessment and geometric accuracy of these line simplification algorithms.But the work on the efficiency of these algorithms is less.The efficiency of the line simplification algorithms was studied on the basis of considering the simplifying quality.The line simplification algorithms were divided into six categories through analyzing its constraint parameters,several typical algorithms were selected and its time complexity were analyzed.The line simplification algorithms were divided into two categories,such as linear and nonlinear algorithm through analyzing its time complexity features.And the parallel computing environment which was suitabe to these two types of algorithms were preliminary studied.
Keywords:linear element  simplification algorithm  time complexity  constraint parameter  parallel computation
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号