摘要
针对目前还没有一种算法能在道路化简(删点)的同时又能实现道路光滑(增点)的情形,提出了将Douglas-Peucker算法和Li-Openshaw算法组合优化起来对道路进行综合的思想。本文首先对线状要素综合的两种经典算法Douglas算法和Li-Openshaw算法各自的优缺点进行了分析,在此基础上对Li-Openshaw算法进行了改进,最后融合两种算法的优点,设计了一种道路综合的组合优化算法,在实践中取得了较好的效果。
Road generalization （delete nodes） is contradictory to road smoothing （add nodes）. To overcome the difficulty men-ioned above, an effective method of road generalization is proposed. It focuses on combinatorial optimization of Douglas-Peucker and Li-Openshaw algorithms. This paper first makes an analysis of two classical line generalization and then improves on the Li-Openshaw algorithm. At last it realizes the combinatorial optimization method of road generalization, which have a satisfying effect in practice.
出处
《测绘科学》
CSCD
北大核心
2009年第5期11-13,共3页
Science of Surveying and Mapping
基金
国家863计划资助项目(2007AA12Z206)
国家自然科学基金资助项目(40501058
40401052)
