A general method is given for constructing sets of sufficient linear conditions that ensure convexity of a polynomial in Bernstein-Bezier form on a triangle. Using the linear conditions, computational methods based on macro-element spline spaces are developed to construct convexity preserving splines over triangulations that interpolate or approximate given scattered data.
Schumaker, L.l., Speleers, H. (2011). Convexity preserving splines over triangulations. COMPUTER AIDED GEOMETRIC DESIGN, 28(4), 270-284 [10.1016/j.cagd.2011.03.001].
Convexity preserving splines over triangulations
Speleers H.
2011-05-01
Abstract
A general method is given for constructing sets of sufficient linear conditions that ensure convexity of a polynomial in Bernstein-Bezier form on a triangle. Using the linear conditions, computational methods based on macro-element spline spaces are developed to construct convexity preserving splines over triangulations that interpolate or approximate given scattered data.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.