inside = false;\\n var acc = 0.;\\n //just for computations\\n var q: f32;\\n\\n // for every pair of adjacent points:\\n // cast a triangle to 0,0 (or any other point)\\n // inside triangle ?\\n // flip inside variable\\n for (var i = 0; i < 12; i++) { \\n // triangle sdf serves as replacement for vertex pipeline\\n q = sdTriangle(f, path[i], path[i+1], vec2f(0.0,0.0), );\\n\\n if q > 0.1 {\\n inside = !inside;\\n acc += .05;\\n }\\n }\\n\\n // color\\n if inside {\\n col = ( vec4f(.5,0.,.6,1.,) );\\n\\n } else {\\n col = (vec4f(1.,1.,1.,1.,) );\\n }\\n\\n // add curvy outlines\\n // +++ note this\\n for (var j = 0; j < 12; j+=3) {\\n // are we inside the bounding triangle of the curve?\\n q = sdTriangle(f, path[j], path[j+1], path[j+2], );\\n // if no, we don't care about it\\n if q > 0.0 {\\n continue;\\n }\\n\\n // Is the point with the area between the curve and line segment A C?\\n let t = bezierTest(f, path[j], path[j+1], path[j+2]);\\n \\n inside = t;\\n if inside {\\n acc += .05;\\n \\n } else {\\n col = (vec4f(1.,1.,1.,1.,) );\\n }\\n \\n }\\n\\n \\n // DEBUG view\\n if custom.debug > .5 {\\n col = vec4f(acc);\\n }\\n \\n // Convert from gamma-encoded to linear colour space\\n col = pow(col, vec4f(2.2));\\n\\n // Output to screen (linear colour space)\\n textureStore(screen, id.xy, col);\\n}\\n\\nfn sdTriangle(p: vec2f, p0: vec2f, p1: vec2f, p2: vec2f) -> f32 {\\n let e0 = p1 - p0; let e1 = p2 - p1; let e2 = p0 - p2;\\n let v0 = p - p0; let v1 = p - p1; let v2 = p - p2;\\n let pq0 = v0 - e0 * clamp(dot(v0, e0) / dot(e0, e0), 0., 1.);\\n let pq1 = v1 - e1 * clamp(dot(v1, e1) / dot(e1, e1), 0., 1.);\\n let pq2 = v2 - e2 * clamp(dot(v2, e2) / dot(e2, e2), 0., 1.);\\n let s = sign(e0.x * e2.y - e0.y * e2.x);\\n let d = min(min(vec2f(dot(pq0, pq0), s * (v0.x * e0.y - v0.y * e0.x)),\\n vec2f(dot(pq1, pq1), s * (v1.x * e1.y - v1.y * e1.x))),\\n vec2f(dot(pq2, pq2), s * (v2.x * e2.y - v2.y * e2.x)));\\n return -sqrt(d.x) * sign(d.y);\\n}\\n\\n/// Is the point with the area between the curve and line segment A C?\\nfn bezierTest(p: vec2, A: vec2, B: vec2, C: vec2) -> bool {\\n\\n // Compute barycentric coordinates of p.\\n // p = s * A + t * B + (1-s-t) * C\\n let v0 = B - A; let v1 = C - A; let v2 = p - A;\\n let det = v0.x * v1.y - v1.x * v0.y;\\n let s = (v2.x * v1.y - v1.x * v2.y) / det;\\n let t = (v0.x * v2.y - v2.x * v0.y) / det;\\n\\n if(s < 0.0 || t < 0.0 || (1.0-s-t) < 0.0) {\\n return false; // outside triangle\\n }\\n\\n // Transform to canonical coordinte space.\\n let u = s * 0.5 + t;\\n let v = t;\\n\\n return u*u < v;\\n\\n}\\nfn sdCircle(p: vec2f, r: f32) -> f32 {\\n return length(p) - r;\\n}\\n\\n\\n\\nconst PI = 3.1415927;\\nconst TAU = 6.2831853;\\n// solve_quadratic(), solve_cubic(), solve() and sd_bezier() are from\\n// Quadratic Bezier SDF With L2 - Envy24\\n// https://www.shadertoy.com/view/7sGyWd\\n// with modification. Thank you! I tried a lot of different sd_bezier()\\n// implementations from across Shadertoy (including trying to make it\\n// myself) and all of them had bugs and incorrect edge case handling\\n// except this one.\\n\\nfn solve_quadratic(a: f32, b: f32, c: f32, roots: ptr) -> u32 {\\n // Return the number of real roots to the equation\\n // a*x^2 + b*x + c = 0 where a != 0 and populate roots.\\n let discriminant = b * b - 4.0 * a * c;\\n\\n if (discriminant < 0.0) {\\n return 0;\\n }\\n\\n if (discriminant == 0.0) {\\n (*roots)[0] = -b / (2.0 * a);\\n return 1;\\n }\\n\\n let SQRT = sqrt(discriminant);\\n (*roots)[0] = (-b + SQRT) / (2.0 * a);\\n (*roots)[1] = (-b - SQRT) / (2.0 * a);\\n return 2;\\n}

@compute.toys