摘要
基于Douglas Peucker(简称D P算法 )曲线综合方法存在的主要问题 ,提出并初步实现了相应的克服算法
Douglas-Peucker method is a famous method for curve generalization in automated cartography. However, this method has several disadvantages, for example it is possible that the maximal offset value of lower hierarchy is bigger than the maximal offset value of the upper hierarchy. Addressing these disadvantages, this paper suggests and realizes corresponding algorithms to overcome those shortcomings. These optimization algorithms lead to constructing multi-way tree structure which can serve as a better approach to solve generalization problems. On the basis of the multi-way structure a composite generalization method is realized.
出处
《武汉大学学报（信息科学版）》
EI
CSCD
北大核心
2004年第6期479-483,共5页
Geomatics and Information Science of Wuhan University
基金
国家自然科学基金资助项目 ( 4 0 1710 79)
关键词
D-P算法
多叉树
曲线综合
D-P algorithm
multi-way tree structure
curve generalization
