Hello polycounters !
Everyone knows how booleans work and how cleaning is always required. But overlapping booleans on the same surface plane seems to be infinitely harder to clean
So far the only method I found fast enough is to select the caps verts in side view, delete, and then refill the surface with an n-gon that I would rebuild topology on later. But is there a more reliable, faster and easier way to do this annoying cleanup work ?
I am using Blender and the fast or exact solver don't change anything.
Thanks in advance for any help !
Replies
https://www.youtube.com/@JoshGambrell
i quite like Josh's tutorials, very informative, though he does used some addons