I just wanted to get some spline knowledge, a quick in and out. But you have made me stay and watch multiple videos. Very nice, intresting and to the point.
Thank you very much for this very explanatory video. It is the first time we are studying this with my project students. We would like to make some comments about what we get from the explanations. Please correct us if we are wrong. For NCS, we use f''[x_{k+1}]=g''[x_{k+1}] condition in the middle points together with f''[x_{1}]==0 and g''[x_{n}]==0 at the end points. While, for CRS, we use f'[x_{k+1}]=g'[x_{k+1}]=(g[x_{k+2}]-f[x_{k}])/(x_{k+2}-x_{k}) together with some derivative constraints (such as f'[x_{1}]=0 and g'[x_{n}]=-1) at the end points.
ปีที่แล้ว +2
There is also monotonic cubic interpolation which is commonly used and you might be interested in it if you're watching this: en.wikipedia.org/wiki/Monotone_cubic_interpolation
I was going to mention cubic Hermite interpolation, a form of monotone interpolation. Gotta preface it's use with the fact that the "steps along X" must be equal distant, aka uniform in interval. In other words, CHI doesn't work if X is allowed to be arbitrary real numbers on the number line. I explored both cubic Hermite and Catmull-Rom splines for their use in 8-bit microcontrolers several years ago. I'd link to the stack exchange question, but just googling "cubic spline 8 bit" gets you to it almost the first hit.
I just wanted to get some spline knowledge, a quick in and out. But you have made me stay and watch multiple videos.
Very nice, intresting and to the point.
This is great, thank you very much!!!!
This is gold!!!
Thank you very much for this very explanatory video. It is the first time we are studying this with my project students. We would like to make some comments about what we get from the explanations. Please correct us if we are wrong. For NCS, we use f''[x_{k+1}]=g''[x_{k+1}] condition in the middle points together with f''[x_{1}]==0 and g''[x_{n}]==0 at the end points. While, for CRS, we use f'[x_{k+1}]=g'[x_{k+1}]=(g[x_{k+2}]-f[x_{k}])/(x_{k+2}-x_{k}) together with some derivative constraints (such as f'[x_{1}]=0 and g'[x_{n}]=-1) at the end points.
There is also monotonic cubic interpolation which is commonly used and you might be interested in it if you're watching this: en.wikipedia.org/wiki/Monotone_cubic_interpolation
I was going to mention cubic Hermite interpolation, a form of monotone interpolation. Gotta preface it's use with the fact that the "steps along X" must be equal distant, aka uniform in interval. In other words, CHI doesn't work if X is allowed to be arbitrary real numbers on the number line.
I explored both cubic Hermite and Catmull-Rom splines for their use in 8-bit microcontrolers several years ago. I'd link to the stack exchange question, but just googling "cubic spline 8 bit" gets you to it almost the first hit.