From approximating subdivision schemes for exponential splines to high-performance interpolating algorithms (Q2519728)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5498517
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | From approximating subdivision schemes for exponential splines to high-performance interpolating algorithms |
scientific article; zbMATH DE number 5498517 |
Statements
From approximating subdivision schemes for exponential splines to high-performance interpolating algorithms (English)
0 references
27 January 2009
0 references
Three families of approximating subdivision schemes generating piecewise exponential polynomials are established. The main features of these schemes to reproduce important analytic shapes and to provide high smooth limit curves is complemented with adjustable tension. From these, a 6-point interpolating \(C^2\)-continuous schemes are derived with ability to reproduce the main categories of trigonometric and transcendental curves, to permit tension control and to be easy to implement. Many computer aided geometric design examples are given.
0 references
binary subdivision
0 references
Laurent polynomial formalism
0 references
interpolation
0 references
analytical shapes reproduction
0 references
tension control
0 references
smooth limit curves
0 references
trigonometric and transcendental curves
0 references
computer aided geometric design
0 references
0 references
0 references
0.83369380235672
0 references
0.8326671719551086
0 references
0.8083755373954773
0 references
0.8066287636756897
0 references