Gauss-Legendre polynomial basis for the shape control of polynomial curvesopen access
- Authors
- Moon, Hwan Pyo; Kim, Soo Hyun; Kwon, Song-Hwa
- Issue Date
- Aug-2023
- Publisher
- Elsevier Inc
- Keywords
- Gauss-Legendre polynomial; Gauss-Legendre polygon; Gauss-Legendre quadrature; Pythagorean hodograph curves; Bernstein polynomial; B?zier curve
- Citation
- Applied Mathematics and Computation, v.451, pp 1 - 16
- Pages
- 16
- Indexed
- SCIE
SCOPUS
- Journal Title
- Applied Mathematics and Computation
- Volume
- 451
- Start Page
- 1
- End Page
- 16
- URI
- https://scholarworks.dongguk.edu/handle/sw.dongguk/21222
- DOI
- 10.1016/j.amc.2023.127995
- ISSN
- 0096-3003
1873-5649
- Abstract
- The Gauss-Legendre (GL) polygon was recently introduced for the shape control of Pythagorean hodograph curves. In this paper, we consider the GL polygon of general poly-nomial curves. The GL polygon with n + 1 control points determines a polynomial curve of degree n as a barycentric combination of the control points. We identify the weight func-tions of this barycentric combination and define the GL polynomials, which form a basis of the polynomial space like the Bernstein polynomial basis. We investigate various prop-erties of the GL polynomials such as the partition of unity property, symmetry, endpoint interpolation, and the critical values in comparison with the Bernstein polynomials. We also present the definite integral and higher derivatives of the GL polynomials. We then discuss the shape control of polynomial curves using the GL polygon. We claim that the design process of high degree polynomial curves using the GL polygon is much easier and more predictable than if the curve is given in the Bernstein-Bezier form. This is supported by some neat illustrative examples. (c) 2023 Elsevier Inc. All rights reserved.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Natural Science > Department of Mathematics > 1. Journal Articles

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.