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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
