Is there an easy way to tell if two Paths intersect / overlap?
i think that’s a hard problem because 1. paths can intersect with themselves and 2. they can overlap without touching each other if you think of 2 paths where one of them is the outter one and closed
afaik Juce can’t do it. An “easy” method is using something like PathIterator to recursively split the paths in two parts and check for bounding box overlaps until you end up with single line segments that can be directly checked.
The PathIterator idea worked, but it was a moot point, because because my idea I needed it for didn’t work.