Faster Algorithm for Closed Polygonal Approximation and Its Implementation

• Main Authors: YEH,HSUEH-JU, 葉學儒
• Other Authors: Chung,Kuo-Liang
• Format: Others
• Language: zh-TW
• Published: 2005
• Online Access: http://ndltd.ncl.edu.tw/handle/44692607969770226565

碩士 === 國立臺灣科技大學 === 資訊工程系 === 93 === Given a polygonal curve P with n vertices, the closed polygonal approximation problem is defined to find a closed polygon P' to approximate P with minimal polygonal segments under a given tolerant error. This paper presents an O(En^2)-time algorithm for solving the closed polygonal approximation problem where E denotes the minimum of covering edge numbers for all vertices. Since it's almost always that E<<n, the proposed algorithm is much faster than the previous algorithm, which takes O(n^3) time, for solving the same problem. Based on several real closed curves, experimental results indicate that our proposed algorithm can reduce the overhead of executive time in the previous algorithm up to 97.4% for solving the closed polygonal approximation problem.