Abstract
AbstractThe construction of a C 1 interpolant to scattered data is considered in which the interpolant is positive everywhere if the original data are positive. This study is motivated by earlier work in which sufficient conditions are derived on Bézier points in order to ensure that surfaces comprising cubic Bézier triangular patches are always positive. In the current work, simpler and more relaxed conditions are derived on the Bézier points. The gradients at the data sites are then calculated to ensure that these conditions are satisfied. Each triangular patch of the interpolating surface is formed as a convex combination of three cubic Bézier triangular patches. Its construction is local. A number of examples are presented.KeywordsConvex CombinationDelaunay TriangulationScattered DataData InterpolationPositivity ConstraintThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
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.
