Fitting data using piecewise Gp1s cubic Bﾧezier curves
Lane, Edward J.
Borges, Carlos F.
MetadataShow full item record
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).
Showing items related by title, author, creator and subject.
Lewis, Peter A. W.; Shedler, Gerald S. (Monterey, California. Naval Postgraduate School, 1978-08); NPS55-78-019The nonhomogeneous Poisson process is a widely used model for a series of events (stochastic point process) in which the rate or intensity of occurrence of points varies, usually with time. The process has the characteristic ...
Giraldo, F.X.; Taylor, M. A. (2006);The cornerstone of nodal spectral-element methods is the co-location of the interpolation and integration points, yielding a diagonal mass matrix that is efficient for time-integration. On quadrilateral elements, ...
Giraldo, F.X.; Warburton, T. (2005);A nodal triangle-based spectral element (SE) method for the shallow water equations on the sphere is presented. The original SE method uses quadrilateral elements and high-order nodal Lagrange polynomials, constructed from ...