Selecting Optimal Threshold Value of Douglas-Peucker Algorithm Based on Curve Fit

摘要：

Sample data of Douglas-Peucker algorithm parameter and certain attributes related to simplification quality is obtained by iteration method of simplification algorithm; Functions between threshold with line length, point number, and running time are get by curve fit; Through analyzing curvature of function between threshold with point number, function maximum curvature is confirmed and acts as optimal threshold. Law between parameter with simplification algorithm is revealed from qualitative and quantitative, and then optimal method determining simplification threshold value is also put forward. Its suitable for simplifying large amount of lines data with Douglas-Peucker algorithm by analyzing threshold affecting factors and confirming optimal threshold value.

关键词： line simplification Douglas-Peucker algorithm curve fit maximum curvature optimal threshold

作者: WANG Xiao-li ZHANG De

作者单位: Zhengzhou Information Engineering University 0700＃, No.66, longhai middle road, erqi district Zhengzhou, China

会议类型: 国际会议

会议名称: The First International Conference on Networking and Distributed Computing(第一届网络与分布式计算国际会议 ICNDC 2010)

会议地点: 杭州

会议语种:英文

页码: 251-254

在线出版日期: 2010-10-21（万方平台首次上网日期，不代表论文的发表时间）