Fitting data using piecewise Gp1s cubic Bﾧezier curves
A method is described for least squares filling an ordered set of data in the plane with a free-form curve with no specific function or parameterization given for the data. The method is shown to be effective and uses some techniques from the field of Computer Aided Geometric Design (CAGD). We const...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en_US |
| Published: |
Monterey, California. Naval Postgraduate School
2013
|
| Online Access: | http://hdl.handle.net/10945/31580 |
| id |
ndltd-nps.edu-oai-calhoun.nps.edu-10945-31580 |
|---|---|
| record_format |
oai_dc |
| spelling |
ndltd-nps.edu-oai-calhoun.nps.edu-10945-315802014-11-27T16:18:08Z Fitting data using piecewise Gp1s cubic Bﾧezier curves Lane, Edward J. Franke, Richard Borges, Carlos F. Applied Mathematics A method is described for least squares filling an ordered set of data in the plane with a free-form curve with no specific function or parameterization given for the data. The method is shown to be effective and uses some techniques from the field of Computer Aided Geometric Design (CAGD). We construct a piecewise G cubic Bezier curve from cubic curve segments which have as their initial end points, or knot points, some of the data points. The parameters for the curve are: the knot points, the angles of the tangent vectors at the knot points, and the distances from each knot point to the adjacent control points. The algorithm is developed and three solution curves are presented: Globally Optimized Only (GOO), Segmentally Optimized Only (SOO), and Segmentally then Globally Optimized (SGO). 2013-04-29T22:51:38Z 2013-04-29T22:51:38Z 1995-03 Thesis http://hdl.handle.net/10945/31580 en_US This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. As such, it is in the public domain, and under the provisions of Title 17, United States Code, Section 105, it may not be copyrighted. Monterey, California. Naval Postgraduate School |
| collection |
NDLTD |
| language |
en_US |
| sources |
NDLTD |
| description |
A method is described for least squares filling an ordered set of data in the plane with a free-form curve with no specific function or parameterization given for the data. The method is shown to be effective and uses some techniques from the field of Computer Aided Geometric Design (CAGD). We construct a piecewise G cubic Bezier curve from cubic curve segments which have as their initial end points, or knot points, some of the data points. The parameters for the curve are: the knot points, the angles of the tangent vectors at the knot points, and the distances from each knot point to the adjacent control points. The algorithm is developed and three solution curves are presented: Globally Optimized Only (GOO), Segmentally Optimized Only (SOO), and Segmentally then Globally Optimized (SGO). |
| author2 |
Franke, Richard |
| author_facet |
Franke, Richard Lane, Edward J. |
| author |
Lane, Edward J. |
| spellingShingle |
Lane, Edward J. Fitting data using piecewise Gp1s cubic Bﾧezier curves |
| author_sort |
Lane, Edward J. |
| title |
Fitting data using piecewise Gp1s cubic Bﾧezier curves |
| title_short |
Fitting data using piecewise Gp1s cubic Bﾧezier curves |
| title_full |
Fitting data using piecewise Gp1s cubic Bﾧezier curves |
| title_fullStr |
Fitting data using piecewise Gp1s cubic Bﾧezier curves |
| title_full_unstemmed |
Fitting data using piecewise Gp1s cubic Bﾧezier curves |
| title_sort |
fitting data using piecewise gp1s cubic bﾧezier curves |
| publisher |
Monterey, California. Naval Postgraduate School |
| publishDate |
2013 |
| url |
http://hdl.handle.net/10945/31580 |
| work_keys_str_mv |
AT laneedwardj fittingdatausingpiecewisegp1scubicbdeziercurves |
| _version_ |
1716725234252382208 |