Nail

any exceptions are possible if you have a “bad” polygon (self intersection or hole intersection or some of the external point can be outside). Algorithm is only working with clean...

Hi all. I believe this issue aligns closely with the problems my libraries are designed to solve. [iOverlay](https://github.com/iShape-Rust/iOverlay) – A robust 2D polygon Boolean library that also supports buffering (offsetting),...

Thanks for the detailed description! Implementing this as an extension might be a more flexible approach. The current FillRule doesn’t modify the OverlayGraph, which allows multiple shapes to be extracted...

About 3. All we need to do is check is any link (yellow), as shown in the picture, present in the overlay graph. This link must be at once a...

Hi, thanks for the question! Glad to hear that iOverlay useful. Are you asking about path to path join feature to resolve end to end joint problem? iOverlay is already...

Ok, now your problem is much clearer. It's too specific for a general boolean library, but you can implement it by hand, it's not so complex: - Run a global...