Replies: 1 comment 3 replies
-
Not sure if there is a better way to achieve this. We do lazy evaluation, but we cannot optimize much in this case. You can do this slightly more efficiently by using the split function (https://manifoldcad.org/docs/html/classmanifold_1_1_manifold.html#a60e241b8a56d334b3d2d3dbd2fc808ba), which can compute the intersection and difference together. I am not sure if we should add this optimization to csg tree so it is done automatically, this seems a bit complicated and rare. |
Beta Was this translation helpful? Give feedback.
3 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
Imagine I have MeshA and MeshB.
I want to intersect them such that MeshB leaves its 'impression' on MeshA -- but I don't want any of the parts of MeshB. In Boolean operations, it would be...
(A-B)+(A^B)
Is there a more direct way to achieve this?
Will it matter? I.e. since the computational expense is deferred until 'GetMesh()', do N boolean operations cost the same as 1 boolean operation?
Or, will this not work? I.e. is the system smart enough to optimize away the above operations to just get (A)?
Beta Was this translation helpful? Give feedback.
All reactions