Open waterrhett opened 7 years ago
I am also interested in this, theoretically it should be possible using AABBs but going from theory to implementation here this is beyond my abilities :/
We're already using AABBs to accelerate the triangle-triangle intersections, but there's probably still lots of performance gains to be made.
Are the AABBs applied only to each triangle in the mesh or is there some sort of AABB hierarchy going on?
Hi,
I have a question about the optimization for the boolean operations. Specifically, is there any space-partitioning data structure used in accelerating the operations? As I am trying to apply the union operations to these following two meshes shapes_to_merge.tar.gz (.off files, one with ~16k faces and another with ~500 faces), the computation typically takes ~20 seconds. Is there any option for using such accelerations, if they exist?
Thank you!