测绘科学技术学报2012，Vol.29Issue(3)：226-230,5.DOI:10.3969/j.issn.1673-6338.2012.03.017
线要素化简算法的时间复杂度分析
Time Complexity Analysis of Line Simplification Algorithms
摘要
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.关键词
线要素/化简算法/时间复杂度/约束参数/并行计算Key words
linear element/ simplification algorithm/ time complexity/ constraint parameter/ parallel computation分类
天文与地球科学引用本文复制引用
郭立帅,沈婕,朱伟..线要素化简算法的时间复杂度分析[J].测绘科学技术学报,2012,29(3):226-230,5.基金项目
国家自然科学基金项目(41071288 （）
41171350). （）
