Sample code for implementing closed area boolean operations in JavaScript

This article mainly introduces the method of implementing Boolean operations by polylines

Add the code first

function getOperatedCurves(sourceCurs: Curve[], targetCus: Curve[])
  {
    let source: Polyline | Circle = (sourceCurs[0] instanceof Circle) ? sourceCurs[0] as Circle : new Polyline().Combine(sourceCurs)[0];
    let target: Polyline | Circle = (targetCus[0] instanceof Circle) ? targetCus[0] as Circle : new Polyline().Combine(targetCus)[0];
    try
    {
      if (! || !) throw new Error("Not a closed curve");
    }
    catch (err)
    {
      (err);
    }

    let interPts = (target, );
    let sourceContainerTarget = isTargetCurInSourceCur(source, target);
    let targetContainerSource = isTargetCurInSourceCur(target, source);

    let isContainer = sourceContainerTarget || targetContainerSource;
    let intersectionList: Curve[] = []; //Intersection    let unionList: Curve[] = []; //Unit    let subList: Curve[] = []; //Supplement
    /*
     *The two closed areas have intersection points and are not inclusion relationships, so the area is divided by intersection points.
     */
    if ( &amp;&amp; !isContainer)
    {
      let pars1 = (p =&gt; (p)).sort((a, b) =&gt; a - b);
      let pars2 = (p =&gt; (p)).sort((a, b) =&gt; a - b);

      let cus1: Array&lt;Polyline | Arc&gt; = (pars1);

      (pl =&gt;
      {
        if (isTargetCurInSourceCur(target, pl))
        {
          (pl);
        }
        else
        {
          (pl);
          (pl);
        }
      })

      let cus2: Array&lt;Polyline | Arc&gt; = (pars2);
      (pl =&gt;
      {
        if (isTargetCurInSourceCur(source, pl))
        {
          (pl);
          (pl);
        }
        else
        {
          (pl);
        }
      })

    }
    else
    {
      if (isContainer)
      {
        if (sourceContainerTarget)
        {
          (target);
          (source, target);
          (source);
        }
        else
        {
          (target);
          (source);
        }
      }
      else
      {
        (source, target)
        (source);
      }

    }
    return {
      intersectionList, unionList, subList
    }
  }

Since some curve classes have different implementation methods, here we mainly talk about some ideas for implementing Boolean operations

Determine whether the 2-closed curve is included
Get all the intersection points of 2 closed curves. Here, the intersection points may be circles and lines, lines and lines, circles and circles. There should be many methods to find intersection points on the Internet. In the future, I will write to implement them using JavaScript if I have time.
According to all intersection points, the 2 closed curve is divided into multiple parts
Organize the segmented line segments, where the intersection part is the part where the curve is inside the other side curve, and merge is the part where the other side curve is not inside the other side curve. Subtraction is similar. I don’t want to say it. Details are specific. If it is included, it will be simpler.

The above is all the content of this article. I hope it will be helpful to everyone's study and I hope everyone will support me more.