Convex preserving scattered data interpolation using bivariate \(C^1\) cubic splines (Q1576461): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Convexity preserving interpolation and Powell-Sabin elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear convexity conditions for rectangular and triangular Bernstein-Bézier surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: The convexity of Bernstein polynomials over triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved condition for the convexity of Bernstein-Bézier surfaces over triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3975818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A counterexample to a theorem about the convexity of Powell--Sabin elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convexity of piecewise polynomial functions on triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4291349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scattered data interpolation and approximation using bivariate \(C^{1}\) piecewise cubic polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximation Power of Splines on Triangulated Quadrangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4257514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolation and approximation from convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank

Latest revision as of 13:04, 30 May 2024

scientific article
Language Label Description Also known as
English
Convex preserving scattered data interpolation using bivariate \(C^1\) cubic splines
scientific article

    Statements

    Convex preserving scattered data interpolation using bivariate \(C^1\) cubic splines (English)
    0 references
    0 references
    1 August 2001
    0 references
    The author uses a bivariate \(C^1\) cubic spline space over a triangulated quadrangulation to the convexity preserving surface design problem. This interpolation problem expressed in terms of Bernstein-Bézier polynomials is presented as a quadratically constraint quadratic programming problem. Then the author derives three linearly constraint quadratic programming problems to solve the interpolatory convexity preserving problem. He shows the existence of convexity preserving interpolatory surface under certain conditions on the data.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    interpolation
    0 references
    bivariate splines
    0 references
    scattered data interpolation
    0 references
    Bernstein-Bézier polynomials
    0 references
    convexity preserving surface design
    0 references
    quadratic programming
    0 references