Computes a Boolean operation between two planar straight line graphs.

redPoints, redEdges are the points and edges of the first complex

bluePoints, blueEdges are the points and edges of the second complex

op the boolean operator to compute (Default "xor"). Possible values include:

"xor" - computes the symmetric difference of red and blue

"and" - computes the intersection of red and blue

"or" - computes the union of red and blue

"sub" - comutes the set difference, blue-red

"rsub" - comutes the set difference, red-blue

Returns An object encoding a planar straight line graph with the edges partitioned into two sets:

points are the points of the combined cell complex

red are the edges in the resulting pslg coming from the red graph

blue are the edges in the resulting pslg coming from the blue graph

Note The interiors of red and blue are computed using the same algorithm as cdt2d, which is it counts the parity of the path with the fewest number of boundary crossings for each point. Even parity points are in the exterior, odd parity in the interior.