UNI-MB - logo
UMNIK - logo
 

Search results

Basic search    Advanced search   
Search
request
Library

Currently you are NOT authorised to access e-resources UM. For full access, REGISTER.

1 2
hits: 18
1.
  • Quasi-Bernstein–Bézier poly... Quasi-Bernstein–Bézier polynomials over triangular domain with multiple shape parameters
    Zhu, Yuanpeng; Han, Xuli Applied mathematics and computation, 01/2015, Volume: 250
    Journal Article
    Peer reviewed

    Based on a new developed recursive relation, a class of Quasi-Bernstein–Bézier polynomials over triangular domain with multiple shape parameters, which includes the classical Bernstein–Bézier ...
Full text
2.
Full text

PDF
3.
  • Fourier transform of Bernst... Fourier transform of Bernstein–Bézier polynomials
    Chui, Charles K.; He, Tian-Xiao; Jiang, Qingtang Journal of mathematical analysis and applications, 2007, 2007-01-00, Volume: 325, Issue: 1
    Journal Article
    Peer reviewed
    Open access

    Explicit formulae, in terms of Bernstein–Bézier coefficients, of the Fourier transform of bivariate polynomials on a triangle and univariate polynomials on an interval are derived in this paper. ...
Full text

PDF
4.
  • Circular Bernstein–Bézier s... Circular Bernstein–Bézier spline approximation with knot removal
    Cusimano, Catherine; Stanley, Sonya Journal of computational and applied mathematics, 06/2003, Volume: 155, Issue: 1
    Journal Article, Conference Proceeding
    Peer reviewed
    Open access

    We present a local C 1 spline interpolation scheme based on circular Bernstein–Bézier polynomials. The complexity of the spline can be significantly reduced by removing knots from the spline without ...
Full text

PDF
5.
  • A subdivision algorithm for... A subdivision algorithm for generalized Bernstein–Bézier curves
    Jena, M.K.; Shunmugaraj, P.; Das, P.C. Computer aided geometric design, 09/2001, Volume: 18, Issue: 7
    Journal Article
    Peer reviewed

    In this article we present a computationally efficient subdivision algorithm for the evaluation of generalized Bernstein–Bézier curves. As particular cases we have subdivision algorithms for ...
Full text
6.
  • C1natural neighbor interpol... C1natural neighbor interpolant for partial differential equations
    Sukumar, N.; Moran, B. Numerical methods for partial differential equations, 07/1999, Volume: 15, Issue: 4
    Journal Article
    Peer reviewed

    Natural neighbor coordinates 20 are optimum weighted‐average measures for an irregular arrangement of nodes in ℝn. 26 used the notion of Bézier simplices in natural neighbor coordinates Φ to propose ...
Full text
7.
Full text
8.
  • On a class of polynomial tr... On a class of polynomial triangular macro-elements
    Costantini, Paolo; Manni, Carla Journal of computational and applied mathematics, 10/1996, Volume: 73, Issue: 1
    Journal Article
    Peer reviewed
    Open access

    In this paper we present a new class of polynomial triangular macro-elements of arbitrary degree which are an extension of the classical Clough-Tocher cubic scheme. Their most important property is ...
Full text
9.
  • A bicubic shape-preserving ... A bicubic shape-preserving blending scheme
    Costantini, Paolo; Manni, Carla Computer aided geometric design, 1996, Volume: 13, Issue: 4
    Journal Article
    Peer reviewed

    We propose a local method for the construction of differentiable functions which interpolate a set of gridded data and are monotonicity preserving, that is increasing or decreasing exactly where the ...
Full text
10.
  • Shape criteria of Bernstein... Shape criteria of Bernstein-Bézier polynomials over simplexes
    He, T.-X. Computers & mathematics with applications (1987), 09/1995, Volume: 30, Issue: 3
    Journal Article
    Peer reviewed
    Open access

    This paper discusses the criteria of convexity, monotonicity, and positivity of Bernstein-Bézier polynomials over simplexes.
Full text

PDF
1 2
hits: 18

Load filters