Convexity preserving interpolation and Powell-Sabin elements (Q1200984): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3975818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3031411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voronoi diagrams and arrangements / 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: Piecewise Quadratic Approximations on Triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error Bounds for Hermite Interpolation by Quadratic Splines on an  -Triangulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Shape Preserving Quadratic Spline Interpolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of interpolating given data in three space with a convex function of two variables / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0167-8396(92)90035-n / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1992654770 / rank
 
Normal rank

Latest revision as of 09:08, 30 July 2024

scientific article
Language Label Description Also known as
English
Convexity preserving interpolation and Powell-Sabin elements
scientific article

    Statements

    Convexity preserving interpolation and Powell-Sabin elements (English)
    0 references
    0 references
    0 references
    17 January 1993
    0 references
    The authors study conditions for bivariate interpolants assuming the preservation of local convexity of surfaces. The piecewise linear upper and lower bounds for convex interpolants are established for the general multi-dimensional case. For the bivariate case, the authors derive simple conditions which ensure that certain \(C^ 1\) piecewise quadratics provide a convex interpolant. In particular, for any convex data an adaptative least squares algorithm to determine a well associated collection of tangent planes is proposed.
    0 references
    modeling of curves
    0 references
    Powell-Sabin elements
    0 references
    finite elements
    0 references
    multivariate interpolation
    0 references
    convexity
    0 references
    convex interpolants
    0 references
    adaptative least squares algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references