Curve intersection, scale width based on ribbon orientation

Percentage Accurate: 97.5% → 98.8%
Time: 9.9s
Alternatives: 7
Speedup: 27.0×

Specification

?
\[\left(\left(\left(0 \leq normAngle \land normAngle \leq \frac{\mathsf{PI}\left(\right)}{2}\right) \land \left(-1 \leq n0\_i \land n0\_i \leq 1\right)\right) \land \left(-1 \leq n1\_i \land n1\_i \leq 1\right)\right) \land \left(2.328306437 \cdot 10^{-10} \leq u \land u \leq 1\right)\]
\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{1}{\sin normAngle}\\ \left(\sin \left(\left(1 - u\right) \cdot normAngle\right) \cdot t\_0\right) \cdot n0\_i + \left(\sin \left(u \cdot normAngle\right) \cdot t\_0\right) \cdot n1\_i \end{array} \end{array} \]
(FPCore (normAngle u n0_i n1_i)
 :precision binary32
 (let* ((t_0 (/ 1.0 (sin normAngle))))
   (+
    (* (* (sin (* (- 1.0 u) normAngle)) t_0) n0_i)
    (* (* (sin (* u normAngle)) t_0) n1_i))))
float code(float normAngle, float u, float n0_i, float n1_i) {
	float t_0 = 1.0f / sinf(normAngle);
	return ((sinf(((1.0f - u) * normAngle)) * t_0) * n0_i) + ((sinf((u * normAngle)) * t_0) * n1_i);
}
real(4) function code(normangle, u, n0_i, n1_i)
    real(4), intent (in) :: normangle
    real(4), intent (in) :: u
    real(4), intent (in) :: n0_i
    real(4), intent (in) :: n1_i
    real(4) :: t_0
    t_0 = 1.0e0 / sin(normangle)
    code = ((sin(((1.0e0 - u) * normangle)) * t_0) * n0_i) + ((sin((u * normangle)) * t_0) * n1_i)
end function
function code(normAngle, u, n0_i, n1_i)
	t_0 = Float32(Float32(1.0) / sin(normAngle))
	return Float32(Float32(Float32(sin(Float32(Float32(Float32(1.0) - u) * normAngle)) * t_0) * n0_i) + Float32(Float32(sin(Float32(u * normAngle)) * t_0) * n1_i))
end
function tmp = code(normAngle, u, n0_i, n1_i)
	t_0 = single(1.0) / sin(normAngle);
	tmp = ((sin(((single(1.0) - u) * normAngle)) * t_0) * n0_i) + ((sin((u * normAngle)) * t_0) * n1_i);
end
\begin{array}{l}

\\
\begin{array}{l}
t_0 := \frac{1}{\sin normAngle}\\
\left(\sin \left(\left(1 - u\right) \cdot normAngle\right) \cdot t\_0\right) \cdot n0\_i + \left(\sin \left(u \cdot normAngle\right) \cdot t\_0\right) \cdot n1\_i
\end{array}
\end{array}

Sampling outcomes in binary32 precision:

Local Percentage Accuracy vs ?

The average percentage accuracy by input value. Horizontal axis shows value of an input variable; the variable is choosen in the title. Vertical axis is accuracy; higher is better. Red represent the original program, while blue represents Herbie's suggestion. These can be toggled with buttons below the plot. The line is an average while dots represent individual samples.

Accuracy vs Speed?

Herbie found 7 alternatives:

AlternativeAccuracySpeedup
The accuracy (vertical axis) and speed (horizontal axis) of each alternatives. Up and to the right is better. The red square shows the initial program, and each blue circle shows an alternative.The line shows the best available speed-accuracy tradeoffs.

Initial Program: 97.5% accurate, 1.0× speedup?

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{1}{\sin normAngle}\\ \left(\sin \left(\left(1 - u\right) \cdot normAngle\right) \cdot t\_0\right) \cdot n0\_i + \left(\sin \left(u \cdot normAngle\right) \cdot t\_0\right) \cdot n1\_i \end{array} \end{array} \]
(FPCore (normAngle u n0_i n1_i)
 :precision binary32
 (let* ((t_0 (/ 1.0 (sin normAngle))))
   (+
    (* (* (sin (* (- 1.0 u) normAngle)) t_0) n0_i)
    (* (* (sin (* u normAngle)) t_0) n1_i))))
float code(float normAngle, float u, float n0_i, float n1_i) {
	float t_0 = 1.0f / sinf(normAngle);
	return ((sinf(((1.0f - u) * normAngle)) * t_0) * n0_i) + ((sinf((u * normAngle)) * t_0) * n1_i);
}
real(4) function code(normangle, u, n0_i, n1_i)
    real(4), intent (in) :: normangle
    real(4), intent (in) :: u
    real(4), intent (in) :: n0_i
    real(4), intent (in) :: n1_i
    real(4) :: t_0
    t_0 = 1.0e0 / sin(normangle)
    code = ((sin(((1.0e0 - u) * normangle)) * t_0) * n0_i) + ((sin((u * normangle)) * t_0) * n1_i)
end function
function code(normAngle, u, n0_i, n1_i)
	t_0 = Float32(Float32(1.0) / sin(normAngle))
	return Float32(Float32(Float32(sin(Float32(Float32(Float32(1.0) - u) * normAngle)) * t_0) * n0_i) + Float32(Float32(sin(Float32(u * normAngle)) * t_0) * n1_i))
end
function tmp = code(normAngle, u, n0_i, n1_i)
	t_0 = single(1.0) / sin(normAngle);
	tmp = ((sin(((single(1.0) - u) * normAngle)) * t_0) * n0_i) + ((sin((u * normAngle)) * t_0) * n1_i);
end
\begin{array}{l}

\\
\begin{array}{l}
t_0 := \frac{1}{\sin normAngle}\\
\left(\sin \left(\left(1 - u\right) \cdot normAngle\right) \cdot t\_0\right) \cdot n0\_i + \left(\sin \left(u \cdot normAngle\right) \cdot t\_0\right) \cdot n1\_i
\end{array}
\end{array}

Alternative 1: 98.8% accurate, 3.5× speedup?

\[\begin{array}{l} \\ \left(1 - u\right) \cdot n0\_i + \left(\frac{normAngle}{\sin normAngle} \cdot u\right) \cdot n1\_i \end{array} \]
(FPCore (normAngle u n0_i n1_i)
 :precision binary32
 (+ (* (- 1.0 u) n0_i) (* (* (/ normAngle (sin normAngle)) u) n1_i)))
float code(float normAngle, float u, float n0_i, float n1_i) {
	return ((1.0f - u) * n0_i) + (((normAngle / sinf(normAngle)) * u) * n1_i);
}
real(4) function code(normangle, u, n0_i, n1_i)
    real(4), intent (in) :: normangle
    real(4), intent (in) :: u
    real(4), intent (in) :: n0_i
    real(4), intent (in) :: n1_i
    code = ((1.0e0 - u) * n0_i) + (((normangle / sin(normangle)) * u) * n1_i)
end function
function code(normAngle, u, n0_i, n1_i)
	return Float32(Float32(Float32(Float32(1.0) - u) * n0_i) + Float32(Float32(Float32(normAngle / sin(normAngle)) * u) * n1_i))
end
function tmp = code(normAngle, u, n0_i, n1_i)
	tmp = ((single(1.0) - u) * n0_i) + (((normAngle / sin(normAngle)) * u) * n1_i);
end
\begin{array}{l}

\\
\left(1 - u\right) \cdot n0\_i + \left(\frac{normAngle}{\sin normAngle} \cdot u\right) \cdot n1\_i
\end{array}
Derivation
  1. Initial program 96.8%

    \[\left(\sin \left(\left(1 - u\right) \cdot normAngle\right) \cdot \frac{1}{\sin normAngle}\right) \cdot n0\_i + \left(\sin \left(u \cdot normAngle\right) \cdot \frac{1}{\sin normAngle}\right) \cdot n1\_i \]
  2. Add Preprocessing
  3. Taylor expanded in u around 0

    \[\leadsto \left(\sin \left(\left(1 - u\right) \cdot normAngle\right) \cdot \frac{1}{\sin normAngle}\right) \cdot n0\_i + \color{blue}{\frac{normAngle \cdot u}{\sin normAngle}} \cdot n1\_i \]
  4. Step-by-step derivation
    1. associate-*l/N/A

      \[\leadsto \left(\sin \left(\left(1 - u\right) \cdot normAngle\right) \cdot \frac{1}{\sin normAngle}\right) \cdot n0\_i + \color{blue}{\left(\frac{normAngle}{\sin normAngle} \cdot u\right)} \cdot n1\_i \]
    2. lower-*.f32N/A

      \[\leadsto \left(\sin \left(\left(1 - u\right) \cdot normAngle\right) \cdot \frac{1}{\sin normAngle}\right) \cdot n0\_i + \color{blue}{\left(\frac{normAngle}{\sin normAngle} \cdot u\right)} \cdot n1\_i \]
    3. lower-/.f32N/A

      \[\leadsto \left(\sin \left(\left(1 - u\right) \cdot normAngle\right) \cdot \frac{1}{\sin normAngle}\right) \cdot n0\_i + \left(\color{blue}{\frac{normAngle}{\sin normAngle}} \cdot u\right) \cdot n1\_i \]
    4. lower-sin.f3298.5

      \[\leadsto \left(\sin \left(\left(1 - u\right) \cdot normAngle\right) \cdot \frac{1}{\sin normAngle}\right) \cdot n0\_i + \left(\frac{normAngle}{\color{blue}{\sin normAngle}} \cdot u\right) \cdot n1\_i \]
  5. Applied rewrites98.5%

    \[\leadsto \left(\sin \left(\left(1 - u\right) \cdot normAngle\right) \cdot \frac{1}{\sin normAngle}\right) \cdot n0\_i + \color{blue}{\left(\frac{normAngle}{\sin normAngle} \cdot u\right)} \cdot n1\_i \]
  6. Taylor expanded in normAngle around 0

    \[\leadsto \color{blue}{\left(1 - u\right)} \cdot n0\_i + \left(\frac{normAngle}{\sin normAngle} \cdot u\right) \cdot n1\_i \]
  7. Step-by-step derivation
    1. lower--.f3299.0

      \[\leadsto \color{blue}{\left(1 - u\right)} \cdot n0\_i + \left(\frac{normAngle}{\sin normAngle} \cdot u\right) \cdot n1\_i \]
  8. Applied rewrites99.0%

    \[\leadsto \color{blue}{\left(1 - u\right)} \cdot n0\_i + \left(\frac{normAngle}{\sin normAngle} \cdot u\right) \cdot n1\_i \]
  9. Add Preprocessing

Alternative 2: 67.0% accurate, 16.9× speedup?

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;n1\_i \leq -2.99999994735501 \cdot 10^{-14} \lor \neg \left(n1\_i \leq 4.999999918875795 \cdot 10^{-18}\right):\\ \;\;\;\;\left(n1\_i - n0\_i\right) \cdot u\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(n1\_i, u, n0\_i \cdot \left(1 - u\right)\right)\\ \end{array} \end{array} \]
(FPCore (normAngle u n0_i n1_i)
 :precision binary32
 (if (or (<= n1_i -2.99999994735501e-14) (not (<= n1_i 4.999999918875795e-18)))
   (* (- n1_i n0_i) u)
   (fma n1_i u (* n0_i (- 1.0 u)))))
float code(float normAngle, float u, float n0_i, float n1_i) {
	float tmp;
	if ((n1_i <= -2.99999994735501e-14f) || !(n1_i <= 4.999999918875795e-18f)) {
		tmp = (n1_i - n0_i) * u;
	} else {
		tmp = fmaf(n1_i, u, (n0_i * (1.0f - u)));
	}
	return tmp;
}
function code(normAngle, u, n0_i, n1_i)
	tmp = Float32(0.0)
	if ((n1_i <= Float32(-2.99999994735501e-14)) || !(n1_i <= Float32(4.999999918875795e-18)))
		tmp = Float32(Float32(n1_i - n0_i) * u);
	else
		tmp = fma(n1_i, u, Float32(n0_i * Float32(Float32(1.0) - u)));
	end
	return tmp
end
\begin{array}{l}

\\
\begin{array}{l}
\mathbf{if}\;n1\_i \leq -2.99999994735501 \cdot 10^{-14} \lor \neg \left(n1\_i \leq 4.999999918875795 \cdot 10^{-18}\right):\\
\;\;\;\;\left(n1\_i - n0\_i\right) \cdot u\\

\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(n1\_i, u, n0\_i \cdot \left(1 - u\right)\right)\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes
  2. if n1_i < -2.99999995e-14 or 4.99999992e-18 < n1_i

    1. Initial program 96.8%

      \[\left(\sin \left(\left(1 - u\right) \cdot normAngle\right) \cdot \frac{1}{\sin normAngle}\right) \cdot n0\_i + \left(\sin \left(u \cdot normAngle\right) \cdot \frac{1}{\sin normAngle}\right) \cdot n1\_i \]
    2. Add Preprocessing
    3. Taylor expanded in normAngle around 0

      \[\leadsto \color{blue}{n0\_i \cdot \left(1 - u\right) + n1\_i \cdot u} \]
    4. Step-by-step derivation
      1. *-commutativeN/A

        \[\leadsto \color{blue}{\left(1 - u\right) \cdot n0\_i} + n1\_i \cdot u \]
      2. lower-fma.f32N/A

        \[\leadsto \color{blue}{\mathsf{fma}\left(1 - u, n0\_i, n1\_i \cdot u\right)} \]
      3. lower--.f32N/A

        \[\leadsto \mathsf{fma}\left(\color{blue}{1 - u}, n0\_i, n1\_i \cdot u\right) \]
      4. lower-*.f3269.2

        \[\leadsto \mathsf{fma}\left(1 - u, n0\_i, \color{blue}{n1\_i \cdot u}\right) \]
    5. Applied rewrites68.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(1 - u, n0\_i, n1\_i \cdot u\right)} \]
    6. Taylor expanded in u around inf

      \[\leadsto u \cdot \color{blue}{\left(n1\_i + -1 \cdot n0\_i\right)} \]
    7. Step-by-step derivation
      1. Applied rewrites68.3%

        \[\leadsto \left(n1\_i - n0\_i\right) \cdot \color{blue}{u} \]

      if -2.99999995e-14 < n1_i < 4.99999992e-18

      1. Initial program 96.9%

        \[\left(\sin \left(\left(1 - u\right) \cdot normAngle\right) \cdot \frac{1}{\sin normAngle}\right) \cdot n0\_i + \left(\sin \left(u \cdot normAngle\right) \cdot \frac{1}{\sin normAngle}\right) \cdot n1\_i \]
      2. Add Preprocessing
      3. Taylor expanded in normAngle around 0

        \[\leadsto \color{blue}{n0\_i \cdot \left(1 - u\right) + n1\_i \cdot u} \]
      4. Step-by-step derivation
        1. *-commutativeN/A

          \[\leadsto \color{blue}{\left(1 - u\right) \cdot n0\_i} + n1\_i \cdot u \]
        2. lower-fma.f32N/A

          \[\leadsto \color{blue}{\mathsf{fma}\left(1 - u, n0\_i, n1\_i \cdot u\right)} \]
        3. lower--.f32N/A

          \[\leadsto \mathsf{fma}\left(\color{blue}{1 - u}, n0\_i, n1\_i \cdot u\right) \]
        4. lower-*.f3218.3

          \[\leadsto \mathsf{fma}\left(1 - u, n0\_i, \color{blue}{n1\_i \cdot u}\right) \]
      5. Applied rewrites18.3%

        \[\leadsto \color{blue}{\mathsf{fma}\left(1 - u, n0\_i, n1\_i \cdot u\right)} \]
      6. Step-by-step derivation
        1. Applied rewrites81.2%

          \[\leadsto \mathsf{fma}\left(n1\_i, \color{blue}{u}, n0\_i \cdot \left(1 - u\right)\right) \]
      7. Recombined 2 regimes into one program.
      8. Final simplification76.4%

        \[\leadsto \begin{array}{l} \mathbf{if}\;n1\_i \leq -2.99999994735501 \cdot 10^{-14} \lor \neg \left(n1\_i \leq 4.999999918875795 \cdot 10^{-18}\right):\\ \;\;\;\;\left(n1\_i - n0\_i\right) \cdot u\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(n1\_i, u, n0\_i \cdot \left(1 - u\right)\right)\\ \end{array} \]
      9. Add Preprocessing

      Alternative 3: 56.9% accurate, 20.8× speedup?

      \[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;n1\_i \leq -2.99999994735501 \cdot 10^{-14} \lor \neg \left(n1\_i \leq 4.999999918875795 \cdot 10^{-18}\right):\\ \;\;\;\;\left(n1\_i - n0\_i\right) \cdot u\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(n1\_i - n0\_i, u, n0\_i\right)\\ \end{array} \end{array} \]
      (FPCore (normAngle u n0_i n1_i)
       :precision binary32
       (if (or (<= n1_i -2.99999994735501e-14) (not (<= n1_i 4.999999918875795e-18)))
         (* (- n1_i n0_i) u)
         (fma (- n1_i n0_i) u n0_i)))
      float code(float normAngle, float u, float n0_i, float n1_i) {
      	float tmp;
      	if ((n1_i <= -2.99999994735501e-14f) || !(n1_i <= 4.999999918875795e-18f)) {
      		tmp = (n1_i - n0_i) * u;
      	} else {
      		tmp = fmaf((n1_i - n0_i), u, n0_i);
      	}
      	return tmp;
      }
      
      function code(normAngle, u, n0_i, n1_i)
      	tmp = Float32(0.0)
      	if ((n1_i <= Float32(-2.99999994735501e-14)) || !(n1_i <= Float32(4.999999918875795e-18)))
      		tmp = Float32(Float32(n1_i - n0_i) * u);
      	else
      		tmp = fma(Float32(n1_i - n0_i), u, n0_i);
      	end
      	return tmp
      end
      
      \begin{array}{l}
      
      \\
      \begin{array}{l}
      \mathbf{if}\;n1\_i \leq -2.99999994735501 \cdot 10^{-14} \lor \neg \left(n1\_i \leq 4.999999918875795 \cdot 10^{-18}\right):\\
      \;\;\;\;\left(n1\_i - n0\_i\right) \cdot u\\
      
      \mathbf{else}:\\
      \;\;\;\;\mathsf{fma}\left(n1\_i - n0\_i, u, n0\_i\right)\\
      
      
      \end{array}
      \end{array}
      
      Derivation
      1. Split input into 2 regimes
      2. if n1_i < -2.99999995e-14 or 4.99999992e-18 < n1_i

        1. Initial program 96.8%

          \[\left(\sin \left(\left(1 - u\right) \cdot normAngle\right) \cdot \frac{1}{\sin normAngle}\right) \cdot n0\_i + \left(\sin \left(u \cdot normAngle\right) \cdot \frac{1}{\sin normAngle}\right) \cdot n1\_i \]
        2. Add Preprocessing
        3. Taylor expanded in normAngle around 0

          \[\leadsto \color{blue}{n0\_i \cdot \left(1 - u\right) + n1\_i \cdot u} \]
        4. Step-by-step derivation
          1. *-commutativeN/A

            \[\leadsto \color{blue}{\left(1 - u\right) \cdot n0\_i} + n1\_i \cdot u \]
          2. lower-fma.f32N/A

            \[\leadsto \color{blue}{\mathsf{fma}\left(1 - u, n0\_i, n1\_i \cdot u\right)} \]
          3. lower--.f32N/A

            \[\leadsto \mathsf{fma}\left(\color{blue}{1 - u}, n0\_i, n1\_i \cdot u\right) \]
          4. lower-*.f3269.2

            \[\leadsto \mathsf{fma}\left(1 - u, n0\_i, \color{blue}{n1\_i \cdot u}\right) \]
        5. Applied rewrites68.4%

          \[\leadsto \color{blue}{\mathsf{fma}\left(1 - u, n0\_i, n1\_i \cdot u\right)} \]
        6. Taylor expanded in u around inf

          \[\leadsto u \cdot \color{blue}{\left(n1\_i + -1 \cdot n0\_i\right)} \]
        7. Step-by-step derivation
          1. Applied rewrites68.3%

            \[\leadsto \left(n1\_i - n0\_i\right) \cdot \color{blue}{u} \]

          if -2.99999995e-14 < n1_i < 4.99999992e-18

          1. Initial program 96.9%

            \[\left(\sin \left(\left(1 - u\right) \cdot normAngle\right) \cdot \frac{1}{\sin normAngle}\right) \cdot n0\_i + \left(\sin \left(u \cdot normAngle\right) \cdot \frac{1}{\sin normAngle}\right) \cdot n1\_i \]
          2. Add Preprocessing
          3. Taylor expanded in normAngle around 0

            \[\leadsto \color{blue}{n0\_i \cdot \left(1 - u\right) + n1\_i \cdot u} \]
          4. Step-by-step derivation
            1. *-commutativeN/A

              \[\leadsto \color{blue}{\left(1 - u\right) \cdot n0\_i} + n1\_i \cdot u \]
            2. lower-fma.f32N/A

              \[\leadsto \color{blue}{\mathsf{fma}\left(1 - u, n0\_i, n1\_i \cdot u\right)} \]
            3. lower--.f32N/A

              \[\leadsto \mathsf{fma}\left(\color{blue}{1 - u}, n0\_i, n1\_i \cdot u\right) \]
            4. lower-*.f3218.3

              \[\leadsto \mathsf{fma}\left(1 - u, n0\_i, \color{blue}{n1\_i \cdot u}\right) \]
          5. Applied rewrites18.3%

            \[\leadsto \color{blue}{\mathsf{fma}\left(1 - u, n0\_i, n1\_i \cdot u\right)} \]
          6. Taylor expanded in u around inf

            \[\leadsto u \cdot \color{blue}{\left(n1\_i + -1 \cdot n0\_i\right)} \]
          7. Step-by-step derivation
            1. Applied rewrites16.1%

              \[\leadsto \left(n1\_i - n0\_i\right) \cdot \color{blue}{u} \]
            2. Taylor expanded in u around 0

              \[\leadsto n0\_i + \color{blue}{u \cdot \left(n1\_i + -1 \cdot n0\_i\right)} \]
            3. Step-by-step derivation
              1. Applied rewrites61.8%

                \[\leadsto \mathsf{fma}\left(n1\_i - n0\_i, \color{blue}{u}, n0\_i\right) \]
            4. Recombined 2 regimes into one program.
            5. Final simplification64.4%

              \[\leadsto \begin{array}{l} \mathbf{if}\;n1\_i \leq -2.99999994735501 \cdot 10^{-14} \lor \neg \left(n1\_i \leq 4.999999918875795 \cdot 10^{-18}\right):\\ \;\;\;\;\left(n1\_i - n0\_i\right) \cdot u\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(n1\_i - n0\_i, u, n0\_i\right)\\ \end{array} \]
            6. Add Preprocessing

            Alternative 4: 98.0% accurate, 27.0× speedup?

            \[\begin{array}{l} \\ n1\_i \cdot u + \left(n0\_i - n0\_i \cdot u\right) \end{array} \]
            (FPCore (normAngle u n0_i n1_i)
             :precision binary32
             (+ (* n1_i u) (- n0_i (* n0_i u))))
            float code(float normAngle, float u, float n0_i, float n1_i) {
            	return (n1_i * u) + (n0_i - (n0_i * u));
            }
            
            real(4) function code(normangle, u, n0_i, n1_i)
                real(4), intent (in) :: normangle
                real(4), intent (in) :: u
                real(4), intent (in) :: n0_i
                real(4), intent (in) :: n1_i
                code = (n1_i * u) + (n0_i - (n0_i * u))
            end function
            
            function code(normAngle, u, n0_i, n1_i)
            	return Float32(Float32(n1_i * u) + Float32(n0_i - Float32(n0_i * u)))
            end
            
            function tmp = code(normAngle, u, n0_i, n1_i)
            	tmp = (n1_i * u) + (n0_i - (n0_i * u));
            end
            
            \begin{array}{l}
            
            \\
            n1\_i \cdot u + \left(n0\_i - n0\_i \cdot u\right)
            \end{array}
            
            Derivation
            1. Initial program 96.8%

              \[\left(\sin \left(\left(1 - u\right) \cdot normAngle\right) \cdot \frac{1}{\sin normAngle}\right) \cdot n0\_i + \left(\sin \left(u \cdot normAngle\right) \cdot \frac{1}{\sin normAngle}\right) \cdot n1\_i \]
            2. Add Preprocessing
            3. Taylor expanded in normAngle around 0

              \[\leadsto \color{blue}{n0\_i \cdot \left(1 - u\right) + n1\_i \cdot u} \]
            4. Step-by-step derivation
              1. *-commutativeN/A

                \[\leadsto \color{blue}{\left(1 - u\right) \cdot n0\_i} + n1\_i \cdot u \]
              2. lower-fma.f32N/A

                \[\leadsto \color{blue}{\mathsf{fma}\left(1 - u, n0\_i, n1\_i \cdot u\right)} \]
              3. lower--.f32N/A

                \[\leadsto \mathsf{fma}\left(\color{blue}{1 - u}, n0\_i, n1\_i \cdot u\right) \]
              4. lower-*.f3238.8

                \[\leadsto \mathsf{fma}\left(1 - u, n0\_i, \color{blue}{n1\_i \cdot u}\right) \]
            5. Applied rewrites38.8%

              \[\leadsto \color{blue}{\mathsf{fma}\left(1 - u, n0\_i, n1\_i \cdot u\right)} \]
            6. Step-by-step derivation
              1. Applied rewrites97.8%

                \[\leadsto n1\_i \cdot u + \color{blue}{n0\_i \cdot \left(1 - u\right)} \]
              2. Step-by-step derivation
                1. Applied rewrites98.0%

                  \[\leadsto n1\_i \cdot u + \left(n0\_i \cdot 1 + \color{blue}{n0\_i \cdot \left(-u\right)}\right) \]
                2. Final simplification98.0%

                  \[\leadsto n1\_i \cdot u + \left(n0\_i - n0\_i \cdot u\right) \]
                3. Add Preprocessing

                Alternative 5: 97.9% accurate, 27.0× speedup?

                \[\begin{array}{l} \\ n1\_i \cdot u + n0\_i \cdot \left(1 - u\right) \end{array} \]
                (FPCore (normAngle u n0_i n1_i)
                 :precision binary32
                 (+ (* n1_i u) (* n0_i (- 1.0 u))))
                float code(float normAngle, float u, float n0_i, float n1_i) {
                	return (n1_i * u) + (n0_i * (1.0f - u));
                }
                
                real(4) function code(normangle, u, n0_i, n1_i)
                    real(4), intent (in) :: normangle
                    real(4), intent (in) :: u
                    real(4), intent (in) :: n0_i
                    real(4), intent (in) :: n1_i
                    code = (n1_i * u) + (n0_i * (1.0e0 - u))
                end function
                
                function code(normAngle, u, n0_i, n1_i)
                	return Float32(Float32(n1_i * u) + Float32(n0_i * Float32(Float32(1.0) - u)))
                end
                
                function tmp = code(normAngle, u, n0_i, n1_i)
                	tmp = (n1_i * u) + (n0_i * (single(1.0) - u));
                end
                
                \begin{array}{l}
                
                \\
                n1\_i \cdot u + n0\_i \cdot \left(1 - u\right)
                \end{array}
                
                Derivation
                1. Initial program 96.8%

                  \[\left(\sin \left(\left(1 - u\right) \cdot normAngle\right) \cdot \frac{1}{\sin normAngle}\right) \cdot n0\_i + \left(\sin \left(u \cdot normAngle\right) \cdot \frac{1}{\sin normAngle}\right) \cdot n1\_i \]
                2. Add Preprocessing
                3. Taylor expanded in normAngle around 0

                  \[\leadsto \color{blue}{n0\_i \cdot \left(1 - u\right) + n1\_i \cdot u} \]
                4. Step-by-step derivation
                  1. *-commutativeN/A

                    \[\leadsto \color{blue}{\left(1 - u\right) \cdot n0\_i} + n1\_i \cdot u \]
                  2. lower-fma.f32N/A

                    \[\leadsto \color{blue}{\mathsf{fma}\left(1 - u, n0\_i, n1\_i \cdot u\right)} \]
                  3. lower--.f32N/A

                    \[\leadsto \mathsf{fma}\left(\color{blue}{1 - u}, n0\_i, n1\_i \cdot u\right) \]
                  4. lower-*.f3238.8

                    \[\leadsto \mathsf{fma}\left(1 - u, n0\_i, \color{blue}{n1\_i \cdot u}\right) \]
                5. Applied rewrites38.8%

                  \[\leadsto \color{blue}{\mathsf{fma}\left(1 - u, n0\_i, n1\_i \cdot u\right)} \]
                6. Step-by-step derivation
                  1. Applied rewrites97.8%

                    \[\leadsto n1\_i \cdot u + \color{blue}{n0\_i \cdot \left(1 - u\right)} \]
                  2. Add Preprocessing

                  Alternative 6: 36.8% accurate, 51.0× speedup?

                  \[\begin{array}{l} \\ \left(n1\_i - n0\_i\right) \cdot u \end{array} \]
                  (FPCore (normAngle u n0_i n1_i) :precision binary32 (* (- n1_i n0_i) u))
                  float code(float normAngle, float u, float n0_i, float n1_i) {
                  	return (n1_i - n0_i) * u;
                  }
                  
                  real(4) function code(normangle, u, n0_i, n1_i)
                      real(4), intent (in) :: normangle
                      real(4), intent (in) :: u
                      real(4), intent (in) :: n0_i
                      real(4), intent (in) :: n1_i
                      code = (n1_i - n0_i) * u
                  end function
                  
                  function code(normAngle, u, n0_i, n1_i)
                  	return Float32(Float32(n1_i - n0_i) * u)
                  end
                  
                  function tmp = code(normAngle, u, n0_i, n1_i)
                  	tmp = (n1_i - n0_i) * u;
                  end
                  
                  \begin{array}{l}
                  
                  \\
                  \left(n1\_i - n0\_i\right) \cdot u
                  \end{array}
                  
                  Derivation
                  1. Initial program 96.8%

                    \[\left(\sin \left(\left(1 - u\right) \cdot normAngle\right) \cdot \frac{1}{\sin normAngle}\right) \cdot n0\_i + \left(\sin \left(u \cdot normAngle\right) \cdot \frac{1}{\sin normAngle}\right) \cdot n1\_i \]
                  2. Add Preprocessing
                  3. Taylor expanded in normAngle around 0

                    \[\leadsto \color{blue}{n0\_i \cdot \left(1 - u\right) + n1\_i \cdot u} \]
                  4. Step-by-step derivation
                    1. *-commutativeN/A

                      \[\leadsto \color{blue}{\left(1 - u\right) \cdot n0\_i} + n1\_i \cdot u \]
                    2. lower-fma.f32N/A

                      \[\leadsto \color{blue}{\mathsf{fma}\left(1 - u, n0\_i, n1\_i \cdot u\right)} \]
                    3. lower--.f32N/A

                      \[\leadsto \mathsf{fma}\left(\color{blue}{1 - u}, n0\_i, n1\_i \cdot u\right) \]
                    4. lower-*.f3238.8

                      \[\leadsto \mathsf{fma}\left(1 - u, n0\_i, \color{blue}{n1\_i \cdot u}\right) \]
                  5. Applied rewrites38.8%

                    \[\leadsto \color{blue}{\mathsf{fma}\left(1 - u, n0\_i, n1\_i \cdot u\right)} \]
                  6. Taylor expanded in u around inf

                    \[\leadsto u \cdot \color{blue}{\left(n1\_i + -1 \cdot n0\_i\right)} \]
                  7. Step-by-step derivation
                    1. Applied rewrites37.1%

                      \[\leadsto \left(n1\_i - n0\_i\right) \cdot \color{blue}{u} \]
                    2. Add Preprocessing

                    Alternative 7: 7.8% accurate, 57.4× speedup?

                    \[\begin{array}{l} \\ \left(-n0\_i\right) \cdot u \end{array} \]
                    (FPCore (normAngle u n0_i n1_i) :precision binary32 (* (- n0_i) u))
                    float code(float normAngle, float u, float n0_i, float n1_i) {
                    	return -n0_i * u;
                    }
                    
                    real(4) function code(normangle, u, n0_i, n1_i)
                        real(4), intent (in) :: normangle
                        real(4), intent (in) :: u
                        real(4), intent (in) :: n0_i
                        real(4), intent (in) :: n1_i
                        code = -n0_i * u
                    end function
                    
                    function code(normAngle, u, n0_i, n1_i)
                    	return Float32(Float32(-n0_i) * u)
                    end
                    
                    function tmp = code(normAngle, u, n0_i, n1_i)
                    	tmp = -n0_i * u;
                    end
                    
                    \begin{array}{l}
                    
                    \\
                    \left(-n0\_i\right) \cdot u
                    \end{array}
                    
                    Derivation
                    1. Initial program 96.8%

                      \[\left(\sin \left(\left(1 - u\right) \cdot normAngle\right) \cdot \frac{1}{\sin normAngle}\right) \cdot n0\_i + \left(\sin \left(u \cdot normAngle\right) \cdot \frac{1}{\sin normAngle}\right) \cdot n1\_i \]
                    2. Add Preprocessing
                    3. Taylor expanded in normAngle around 0

                      \[\leadsto \color{blue}{n0\_i \cdot \left(1 - u\right) + n1\_i \cdot u} \]
                    4. Step-by-step derivation
                      1. *-commutativeN/A

                        \[\leadsto \color{blue}{\left(1 - u\right) \cdot n0\_i} + n1\_i \cdot u \]
                      2. lower-fma.f32N/A

                        \[\leadsto \color{blue}{\mathsf{fma}\left(1 - u, n0\_i, n1\_i \cdot u\right)} \]
                      3. lower--.f32N/A

                        \[\leadsto \mathsf{fma}\left(\color{blue}{1 - u}, n0\_i, n1\_i \cdot u\right) \]
                      4. lower-*.f3238.8

                        \[\leadsto \mathsf{fma}\left(1 - u, n0\_i, \color{blue}{n1\_i \cdot u}\right) \]
                    5. Applied rewrites38.8%

                      \[\leadsto \color{blue}{\mathsf{fma}\left(1 - u, n0\_i, n1\_i \cdot u\right)} \]
                    6. Taylor expanded in u around inf

                      \[\leadsto u \cdot \color{blue}{\left(n1\_i + -1 \cdot n0\_i\right)} \]
                    7. Step-by-step derivation
                      1. Applied rewrites37.1%

                        \[\leadsto \left(n1\_i - n0\_i\right) \cdot \color{blue}{u} \]
                      2. Taylor expanded in n0_i around inf

                        \[\leadsto \left(-1 \cdot n0\_i\right) \cdot u \]
                      3. Step-by-step derivation
                        1. Applied rewrites7.8%

                          \[\leadsto \left(-n0\_i\right) \cdot u \]
                        2. Add Preprocessing

                        Reproduce

                        ?
                        herbie shell --seed 2024318 
                        (FPCore (normAngle u n0_i n1_i)
                          :name "Curve intersection, scale width based on ribbon orientation"
                          :precision binary32
                          :pre (and (and (and (and (<= 0.0 normAngle) (<= normAngle (/ (PI) 2.0))) (and (<= -1.0 n0_i) (<= n0_i 1.0))) (and (<= -1.0 n1_i) (<= n1_i 1.0))) (and (<= 2.328306437e-10 u) (<= u 1.0)))
                          (+ (* (* (sin (* (- 1.0 u) normAngle)) (/ 1.0 (sin normAngle))) n0_i) (* (* (sin (* u normAngle)) (/ 1.0 (sin normAngle))) n1_i)))