maybe a new algorithm to do clipper

[fililili]

There is an O(n) time complexity algorithm planar face traversal and boost graph lib has implementation. So, we can find intersected points, build an graph, then use planar face traversal to travel it to decide which face is FULFILLED

[fililili]

I have written a new lib by the algorithm, and it can compiler in gdb online directly with c++20. It's very fast (100w points in 10s) in my test. Anybody can help me for later work?
https://github.com/fililili/best_clipper/blob/main/test.cpp