Hi Bruno,
You need [Mass Addition] to perform boolean Gate OR, beside you should provide the equal number of indices same as a number of indices that you want to filter.
es, and these sum up to ~7100. I shall see if I can post a screenshot of everything.
I have no idea how to script that, sorry. But maybe could be a more optimized workflow - just feed one object B at a time, maybe that makes the math behind it more relaxed.
I should emphasize that it is not about 'fault' in the operation, and rather a very slow calculation - the difference does eventually get calculated with no errors whatsoever, the only problem is the unbelievably inefficient, or unproductive time it takes to do so. I think the problem could be the proportion of the objects, one very large, and one very small (28 / 6 / .1cm vs. .05cm), maybe that does something funky to the bounding box calls, I have no idea. And one other thing I suspect is the number of faces in the object, as I progress to let's say 700 cuts, I have then created 700*4 new faces in the object. I don't know if this is indeed something of concern. …
Added by DumDaDaDum at 7:03am on September 29, 2011
Yikes!..... in 1987 when I got my hands on an Apple II computer, it came with a Pong game written in Basic. Even the graphics 28 years ago were better....LOL!
Added by Kim hauer at 5:38pm on September 12, 2015
e
7. True
8. True <-- this one
9. True
10. False
11. True
12. False
13. True
14. True <-- this one
15. True
16. False
17. True
18. False
19. True
20. True <-- this one
21. True
22. False
23. True
24. False
25. True
26. True <-- this one
27. True
28. False
29. True
30. False
31. True
32. True <-- this one
33. True
Any idea how I can solve this?
Thanks!…