Faster Algorithm for Closed Polygonal Approximation and Its Implementation
碩士 === 國立臺灣科技大學 === 資訊工程系 === 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 solv...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/44692607969770226565 |