Curve intersection, scale width based on ribbon orientation

Percentage Accurate: 97.2% → 98.8%

Time: 9.9s

Alternatives: 8

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)\]

Math

\[\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

(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))))

C

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);
}

Fortran

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

Julia

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

MATLAB

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

Initial Program: 97.2% accurate, 1.0× speedup

Math

\[\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

(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))))

C

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);
}

Fortran

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

Julia

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

MATLAB

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

Alternative 1: 98.8% accurate, 3.5× speedup

Math

\[\begin{array}{l} \\ n1\_i \cdot \left(\frac{normAngle}{\sin normAngle} \cdot u\right) + n0\_i \cdot \left(1 - u\right) \end{array} \]

FPCore

(FPCore (normAngle u n0_i n1_i)
 :precision binary32
 (+ (* n1_i (* (/ normAngle (sin normAngle)) u)) (* n0_i (- 1.0 u))))

C

float code(float normAngle, float u, float n0_i, float n1_i) {
	return (n1_i * ((normAngle / sinf(normAngle)) * u)) + (n0_i * (1.0f - u));
}

Fortran

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 * ((normangle / sin(normangle)) * u)) + (n0_i * (1.0e0 - u))
end function

Julia

function code(normAngle, u, n0_i, n1_i)
	return Float32(Float32(n1_i * Float32(Float32(normAngle / sin(normAngle)) * u)) + Float32(n0_i * Float32(Float32(1.0) - u)))
end

MATLAB

function tmp = code(normAngle, u, n0_i, n1_i)
	tmp = (n1_i * ((normAngle / sin(normAngle)) * u)) + (n0_i * (single(1.0) - u));
end

Derivation

1. Initial program 96.3%

   \[\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-*.f32 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 \]

   3. lower-/.f32 N/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.f32 98.6

      \[\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 rewrites 98.6%

   \[\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--.f32 99.3

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

8. Applied rewrites 99.3%

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

9. Final simplification 99.3%

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

Alternative 2: 70.6% accurate, 21.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := n0\_i - n0\_i \cdot u\\ \mathbf{if}\;n0\_i \leq -4.8000001307769655 \cdot 10^{-26}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;n0\_i \leq 9.899999749726406 \cdot 10^{-26}:\\ \;\;\;\;n1\_i \cdot u\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (normAngle u n0_i n1_i)
 :precision binary32
 (let* ((t_0 (- n0_i (* n0_i u))))
   (if (<= n0_i -4.8000001307769655e-26)
     t_0
     (if (<= n0_i 9.899999749726406e-26) (* n1_i u) t_0))))

C

float code(float normAngle, float u, float n0_i, float n1_i) {
	float t_0 = n0_i - (n0_i * u);
	float tmp;
	if (n0_i <= -4.8000001307769655e-26f) {
		tmp = t_0;
	} else if (n0_i <= 9.899999749726406e-26f) {
		tmp = n1_i * u;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

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
    real(4) :: tmp
    t_0 = n0_i - (n0_i * u)
    if (n0_i <= (-4.8000001307769655e-26)) then
        tmp = t_0
    else if (n0_i <= 9.899999749726406e-26) then
        tmp = n1_i * u
    else
        tmp = t_0
    end if
    code = tmp
end function

Julia

function code(normAngle, u, n0_i, n1_i)
	t_0 = Float32(n0_i - Float32(n0_i * u))
	tmp = Float32(0.0)
	if (n0_i <= Float32(-4.8000001307769655e-26))
		tmp = t_0;
	elseif (n0_i <= Float32(9.899999749726406e-26))
		tmp = Float32(n1_i * u);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(normAngle, u, n0_i, n1_i)
	t_0 = n0_i - (n0_i * u);
	tmp = single(0.0);
	if (n0_i <= single(-4.8000001307769655e-26))
		tmp = t_0;
	elseif (n0_i <= single(9.899999749726406e-26))
		tmp = n1_i * u;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Derivation

1. Split input into 2 regimes

2. if n0_i < -4.80000013e-26 or 9.89999975e-26 < n0_i

   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. *-commutative N/A

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

      2. lower-fma.f32 N/A

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

      3. lower--.f32 N/A

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

      4. lower-*.f32 19.5

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

   5. Applied rewrites 19.3%

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

   6. Taylor expanded in n0_i around inf

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

   8. Applied rewrites 77.6%

      \[\leadsto \left(1 - u\right) \cdot \color{blue}{n0\_i} \]
   9. Step-by-step derivation

   10. Applied rewrites 78.1%

       \[\leadsto n0\_i - n0\_i \cdot \color{blue}{u} \]

   if -4.80000013e-26 < n0_i < 9.89999975e-26

   1. Initial program 95.2%

      \[\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. *-commutative N/A

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

      2. lower-fma.f32 N/A

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

      3. lower--.f32 N/A

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

      4. lower-*.f32 72.5

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

   5. Applied rewrites 71.3%

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

   6. Taylor expanded in n0_i around 0

      \[\leadsto n1\_i \cdot \color{blue}{u} \]
   7. Step-by-step derivation

   8. Applied rewrites 72.5%

      \[\leadsto n1\_i \cdot \color{blue}{u} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 70.5% accurate, 21.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := n0\_i \cdot \left(1 - u\right)\\ \mathbf{if}\;n0\_i \leq -4.8000001307769655 \cdot 10^{-26}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;n0\_i \leq 9.899999749726406 \cdot 10^{-26}:\\ \;\;\;\;n1\_i \cdot u\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (normAngle u n0_i n1_i)
 :precision binary32
 (let* ((t_0 (* n0_i (- 1.0 u))))
   (if (<= n0_i -4.8000001307769655e-26)
     t_0
     (if (<= n0_i 9.899999749726406e-26) (* n1_i u) t_0))))

C

float code(float normAngle, float u, float n0_i, float n1_i) {
	float t_0 = n0_i * (1.0f - u);
	float tmp;
	if (n0_i <= -4.8000001307769655e-26f) {
		tmp = t_0;
	} else if (n0_i <= 9.899999749726406e-26f) {
		tmp = n1_i * u;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

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
    real(4) :: tmp
    t_0 = n0_i * (1.0e0 - u)
    if (n0_i <= (-4.8000001307769655e-26)) then
        tmp = t_0
    else if (n0_i <= 9.899999749726406e-26) then
        tmp = n1_i * u
    else
        tmp = t_0
    end if
    code = tmp
end function

Julia

function code(normAngle, u, n0_i, n1_i)
	t_0 = Float32(n0_i * Float32(Float32(1.0) - u))
	tmp = Float32(0.0)
	if (n0_i <= Float32(-4.8000001307769655e-26))
		tmp = t_0;
	elseif (n0_i <= Float32(9.899999749726406e-26))
		tmp = Float32(n1_i * u);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(normAngle, u, n0_i, n1_i)
	t_0 = n0_i * (single(1.0) - u);
	tmp = single(0.0);
	if (n0_i <= single(-4.8000001307769655e-26))
		tmp = t_0;
	elseif (n0_i <= single(9.899999749726406e-26))
		tmp = n1_i * u;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Derivation

1. Split input into 2 regimes

2. if n0_i < -4.80000013e-26 or 9.89999975e-26 < n0_i

   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. *-commutative N/A

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

      2. lower-fma.f32 N/A

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

      3. lower--.f32 N/A

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

      4. lower-*.f32 19.5

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

   5. Applied rewrites 19.5%

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

   6. Taylor expanded in n0_i around inf

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

   8. Applied rewrites 77.6%

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

   if -4.80000013e-26 < n0_i < 9.89999975e-26

   1. Initial program 95.2%

      \[\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. *-commutative N/A

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

      2. lower-fma.f32 N/A

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

      3. lower--.f32 N/A

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

      4. lower-*.f32 72.5

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

   5. Applied rewrites 71.3%

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

   6. Taylor expanded in n0_i around 0

      \[\leadsto n1\_i \cdot \color{blue}{u} \]
   7. Step-by-step derivation

   8. Applied rewrites 72.5%

      \[\leadsto n1\_i \cdot \color{blue}{u} \]
3. Recombined 2 regimes into one program.

4. Final simplification 75.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;n0\_i \leq -4.8000001307769655 \cdot 10^{-26}:\\ \;\;\;\;n0\_i \cdot \left(1 - u\right)\\ \mathbf{elif}\;n0\_i \leq 9.899999749726406 \cdot 10^{-26}:\\ \;\;\;\;n1\_i \cdot u\\ \mathbf{else}:\\ \;\;\;\;n0\_i \cdot \left(1 - u\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 59.9% accurate, 25.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;n0\_i \leq -4.8000001307769655 \cdot 10^{-26}:\\ \;\;\;\;1 \cdot n0\_i\\ \mathbf{elif}\;n0\_i \leq 9.899999749726406 \cdot 10^{-26}:\\ \;\;\;\;n1\_i \cdot u\\ \mathbf{else}:\\ \;\;\;\;1 \cdot n0\_i\\ \end{array} \end{array} \]

FPCore

(FPCore (normAngle u n0_i n1_i)
 :precision binary32
 (if (<= n0_i -4.8000001307769655e-26)
   (* 1.0 n0_i)
   (if (<= n0_i 9.899999749726406e-26) (* n1_i u) (* 1.0 n0_i))))

C

float code(float normAngle, float u, float n0_i, float n1_i) {
	float tmp;
	if (n0_i <= -4.8000001307769655e-26f) {
		tmp = 1.0f * n0_i;
	} else if (n0_i <= 9.899999749726406e-26f) {
		tmp = n1_i * u;
	} else {
		tmp = 1.0f * n0_i;
	}
	return tmp;
}

Fortran

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) :: tmp
    if (n0_i <= (-4.8000001307769655e-26)) then
        tmp = 1.0e0 * n0_i
    else if (n0_i <= 9.899999749726406e-26) then
        tmp = n1_i * u
    else
        tmp = 1.0e0 * n0_i
    end if
    code = tmp
end function

Julia

function code(normAngle, u, n0_i, n1_i)
	tmp = Float32(0.0)
	if (n0_i <= Float32(-4.8000001307769655e-26))
		tmp = Float32(Float32(1.0) * n0_i);
	elseif (n0_i <= Float32(9.899999749726406e-26))
		tmp = Float32(n1_i * u);
	else
		tmp = Float32(Float32(1.0) * n0_i);
	end
	return tmp
end

MATLAB

function tmp_2 = code(normAngle, u, n0_i, n1_i)
	tmp = single(0.0);
	if (n0_i <= single(-4.8000001307769655e-26))
		tmp = single(1.0) * n0_i;
	elseif (n0_i <= single(9.899999749726406e-26))
		tmp = n1_i * u;
	else
		tmp = single(1.0) * n0_i;
	end
	tmp_2 = tmp;
end

Derivation

1. Split input into 2 regimes

2. if n0_i < -4.80000013e-26 or 9.89999975e-26 < n0_i

   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. *-commutative N/A

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

      2. lower-fma.f32 N/A

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

      3. lower--.f32 N/A

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

      4. lower-*.f32 19.5

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

   5. Applied rewrites 19.3%

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

   6. Taylor expanded in n0_i around inf

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

   8. Applied rewrites 77.6%

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

   9. Taylor expanded in u around 0

      \[\leadsto 1 \cdot n0\_i \]
   10. Step-by-step derivation

   11. Applied rewrites 62.1%

       \[\leadsto 1 \cdot n0\_i \]

   if -4.80000013e-26 < n0_i < 9.89999975e-26

   1. Initial program 95.2%

      \[\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. *-commutative N/A

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

      2. lower-fma.f32 N/A

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

      3. lower--.f32 N/A

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

      4. lower-*.f32 33.4

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

   5. Applied rewrites 71.3%

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

   6. Taylor expanded in n0_i around 0

      \[\leadsto n1\_i \cdot \color{blue}{u} \]
   7. Step-by-step derivation

   8. Applied rewrites 72.5%

      \[\leadsto n1\_i \cdot \color{blue}{u} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 98.0% accurate, 27.0× speedup

Math

\[\begin{array}{l} \\ \left(n0\_i - n0\_i \cdot u\right) + n1\_i \cdot u \end{array} \]

FPCore

(FPCore (normAngle u n0_i n1_i)
 :precision binary32
 (+ (- n0_i (* n0_i u)) (* n1_i u)))

C

float code(float normAngle, float u, float n0_i, float n1_i) {
	return (n0_i - (n0_i * u)) + (n1_i * u);
}

Fortran

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 - (n0_i * u)) + (n1_i * u)
end function

Julia

function code(normAngle, u, n0_i, n1_i)
	return Float32(Float32(n0_i - Float32(n0_i * u)) + Float32(n1_i * u))
end

MATLAB

function tmp = code(normAngle, u, n0_i, n1_i)
	tmp = (n0_i - (n0_i * u)) + (n1_i * u);
end

Derivation

1. Initial program 96.3%

   \[\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. *-commutative N/A

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

   2. lower-fma.f32 N/A

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

   3. lower--.f32 N/A

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

   4. lower-*.f32 37.5

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

5. Applied rewrites 37.3%

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

7. Applied rewrites 98.5%

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

9. Applied rewrites 98.9%

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

11. Applied rewrites 98.9%

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

12. Final simplification 98.9%

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

Alternative 6: 97.8% accurate, 27.0× speedup

Math

\[\begin{array}{l} \\ n0\_i \cdot \left(1 - u\right) + n1\_i \cdot u \end{array} \]

FPCore

(FPCore (normAngle u n0_i n1_i)
 :precision binary32
 (+ (* n0_i (- 1.0 u)) (* n1_i u)))

C

float code(float normAngle, float u, float n0_i, float n1_i) {
	return (n0_i * (1.0f - u)) + (n1_i * u);
}

Fortran

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 * (1.0e0 - u)) + (n1_i * u)
end function

Julia

function code(normAngle, u, n0_i, n1_i)
	return Float32(Float32(n0_i * Float32(Float32(1.0) - u)) + Float32(n1_i * u))
end

MATLAB

function tmp = code(normAngle, u, n0_i, n1_i)
	tmp = (n0_i * (single(1.0) - u)) + (n1_i * u);
end

Derivation

1. Initial program 96.3%

   \[\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. *-commutative N/A

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

   2. lower-fma.f32 N/A

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

   3. lower--.f32 N/A

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

   4. lower-*.f32 37.5

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

5. Applied rewrites 37.3%

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

7. Applied rewrites 98.5%

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

8. Final simplification 98.5%

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

Alternative 7: 81.7% accurate, 32.8× speedup

Math

\[\begin{array}{l} \\ 1 \cdot n0\_i + n1\_i \cdot u \end{array} \]

FPCore

(FPCore (normAngle u n0_i n1_i)
 :precision binary32
 (+ (* 1.0 n0_i) (* n1_i u)))

C

float code(float normAngle, float u, float n0_i, float n1_i) {
	return (1.0f * n0_i) + (n1_i * u);
}

Fortran

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 * n0_i) + (n1_i * u)
end function

Julia

function code(normAngle, u, n0_i, n1_i)
	return Float32(Float32(Float32(1.0) * n0_i) + Float32(n1_i * u))
end

MATLAB

function tmp = code(normAngle, u, n0_i, n1_i)
	tmp = (single(1.0) * n0_i) + (n1_i * u);
end

Derivation

1. Initial program 96.3%

   \[\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. *-commutative N/A

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

   2. lower-fma.f32 N/A

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

   3. lower--.f32 N/A

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

   4. lower-*.f32 37.5

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

5. Applied rewrites 37.3%

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

7. Applied rewrites 98.5%

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

8. Taylor expanded in u around 0

   \[\leadsto n1\_i \cdot u + n0\_i \cdot 1 \]
9. Step-by-step derivation

10. Applied rewrites 83.2%

    \[\leadsto n1\_i \cdot u + n0\_i \cdot 1 \]

11. Final simplification 83.2%

    \[\leadsto 1 \cdot n0\_i + n1\_i \cdot u \]
12. Add Preprocessing

Alternative 8: 37.6% accurate, 76.5× speedup

Math

\[\begin{array}{l} \\ n1\_i \cdot u \end{array} \]

FPCore

(FPCore (normAngle u n0_i n1_i) :precision binary32 (* n1_i u))

C

float code(float normAngle, float u, float n0_i, float n1_i) {
	return n1_i * u;
}

Fortran

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
end function

Julia

function code(normAngle, u, n0_i, n1_i)
	return Float32(n1_i * u)
end

MATLAB

function tmp = code(normAngle, u, n0_i, n1_i)
	tmp = n1_i * u;
end

Derivation

1. Initial program 96.3%

   \[\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. *-commutative N/A

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

   2. lower-fma.f32 N/A

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

   3. lower--.f32 N/A

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

   4. lower-*.f32 37.5

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

5. Applied rewrites 37.3%

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

6. Taylor expanded in n0_i around 0

   \[\leadsto n1\_i \cdot \color{blue}{u} \]
7. Step-by-step derivation

8. Applied rewrites 37.5%

   \[\leadsto n1\_i \cdot \color{blue}{u} \]
9. Add Preprocessing

Reproduce

herbie shell --seed 2024283 
(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)))