Abstract | ||
---|---|---|
An algorithm is presented for calculating a suitable normalized B-spline representation for Powell-Sabin splines in which the basis functions are all positive, have local support and form a partition of unity. Computationally, the problem is reduced to the solution of a number of linear or quadratic programming problems of small size. Geometrically, each of these can be interpreted as a problem of determining a triangle of minimal area, containing a specific subset of Bézier points. We further consider a number of CAGD applications such as the determination of a suitable set of tangent control triangles and the efficient and stable calculation of the Bézier net of the PS-spline surface. |
Year | DOI | Venue |
---|---|---|
1997 | 10.1016/S0167-8396(97)81785-2 | Computer Aided Geometric Design |
Keywords | Field | DocType |
bézier net,control points,quadratic programming,powell-sabin splines,linear programming,normalized b-splines,normalized powell-sabin b-splines,quadratic program,partition of unity,linear program | Spline (mathematics),Mathematical optimization,Partition of unity,Interpolation,Bézier curve,Tangent,Linear programming,Basis function,Quadratic programming,Mathematics | Journal |
Volume | Issue | ISSN |
15 | 1 | Computer Aided Geometric Design |
Citations | PageRank | References |
36 | 3.33 | 5 |
Authors | ||
1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Paul Dierckx | 1 | 96 | 12.28 |