Novel Efficient Two-pass Algorithm for Closed Polygonal Approximation Based on LISE and Curvature Constraint Criteria
碩士 === 國立臺灣科技大學 === 資訊工程系 === 94 === Given a closed polygonal curve C with n points, the closed polygonal approximation (CPA) problem is defined to find a closed polygon P to approximate C under some error tolerance criteria. Based on the local integral square error (LISE) and the curvature constrai...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/b8p4q9 |