Lesson plan
smoothstep
Smoothstep is a family of sigmoid-like interpolation and clamping functions commonly used in computer graphics, video game engines, and machine learning. The function depends on three parameters, the input x, the "left edge" and the "right edge", with the left edge being assumed smaller than the right edge. The function receives a real number x as an argument. It returns 0 if x is less than or equal to the left edge and 1 if x is greater than or equal to the right edge. Otherwise, it smoothly interpolates, using Hermite interpolation, and returns a value between 0 and 1. The slope of the smoothstep function is zero at both edges. This is convenient for creating a sequence of transitions using smoothstep to interpolate each segment as an alternative to using more sophisticated or expensive interpolation techniques. In HLSL and GLSL, smoothstep implements the \operatorname{S}_1(x) , the cubic Hermite interpolation after clamping: : \operatorname{smoothstep}(x) = S_1(x) = \begin{cases} 0, & x \le 0 \\ 3x^2 - 2x^3, & 0 \le x \le 1 \\ 1, & 1 \le x \\ \end{cases} Assuming that the left edge is 0, the right edge is 1, with the transition between edges taking place where 0 ≤ x ≤ 1. A modified C/C++ example implementation provided by AMD follows.…
Article summary
Smoothstep is a family of sigmoid-like interpolation and clamping functions commonly used in computer graphics, video game engines, and machine learning. The function depends on three parameters, the input x, the "left edge" and the "right edge", with the left edge being assumed smaller than the right edge. The function receives a real number x as an argument. It returns 0 if x is less than or equal to the left edge and 1 if x is greater than or equal to the right edge. Otherwise, it smoothly interpolates, using Hermite interpolation, and returns a value between 0 and 1. The slope of the smoothstep function is zero at both edges. This is convenient for creating a sequence of transitions using smoothstep to interpolate each segment as an alternative to using more sophisticated or expensive interpolation techniques. In HLSL and GLSL, smoothstep implements the \operatorname{S}_1(x) , the cubic Hermite interpolation after clamping: : \operatorname{smoothstep}(x) = S_1(x) = \begin{cases} 0, & x \le 0 \\ 3x^2 - 2x^3, & 0 \le x \le 1 \\ 1, & 1 \le x \\ \end{cases} Assuming that the left edge is 0, the right edge is 1, with the transition between edges taking place where 0 ≤ x ≤ 1. A modified C/C++ example implementation provided by AMD follows.…
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.