作者: Asif Masood , Shaiq A. Haq
DOI: 10.1016/J.JVCIR.2006.12.002
关键词:
摘要: A new approach to polygonal approximation is presented in this paper. It starts from an initial set of dominant points (break points), where the integral square error a given shape zero. The proposed algorithm iteratively deletes most redundant till required achieved. Stabilization after elimination each point ensures high quality approximation. Results are compared with classical algorithms. has additional benefits like any number and up value robustness results.