Have guys considered using the Martinez algorithm over the current bsp method for boolean operations in V3? #1157
Closed
clupnyluke
started this conversation in
Ideas
Replies: 1 comment 1 reply
-
|
There has been discussions of it. In general, for the 2D boolean operations, Martinez does seem to be the best thing out there. It would be nice to use in jscad. |
Beta Was this translation helpful? Give feedback.
1 reply
-
|
Merged into V3 branch #1177 |
Beta Was this translation helpful? Give feedback.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
This algorithm was discovered in 2009 by Francisco Martinez, Antonio Jesus Rueda, Francisco Ramon Feito and operates in O((n + k) log n) time ( n is number of edges and k - is the number of intersections). I am not aware if this is compatible with the way that the current CSG works or not but I thought I would bring it up. Here is a repo with an implementation of the algorithm. Here is the paper in question
Beta Was this translation helpful? Give feedback.
All reactions