Abstract
A novel unsupervised algorithm is presented for efficient and global computation of periodic second-order B-spline approximations to closed boundaries. Key local geometric information is extracted from a smoothed version of the boundary. This local information allows intelligent partitioning of the boundary and construction of an initial system of equations that often produces a very good approximation. Additional equations are introduced as local constraints to control occasional violations of the user-specified absolute error tolerance. The overdetermined systems of equations are solved by a standard least-squares approach. Computational complexity is compared to two previous algorithms. Experimental results are also provided.
| Original language | English (US) |
|---|---|
| Pages | II565-II568 |
| State | Published - 2002 |
| Event | 2002 45th Midwest Symposium on Circuits and Systems - Tulsa, OK, United States Duration: Aug 4 2002 → Aug 7 2002 |
Other
| Other | 2002 45th Midwest Symposium on Circuits and Systems |
|---|---|
| Country/Territory | United States |
| City | Tulsa, OK |
| Period | 8/4/02 → 8/7/02 |
ASJC Scopus subject areas
- Electronic, Optical and Magnetic Materials
- Electrical and Electronic Engineering