In order to efficiently merge the meshes of the original part and it's corresponding vacuum region, an rTree data structure has been used. The nodes of the vacuum mesh are added to the rTree. Then, when combining with the original parts, we can efficiently find duplicate nodes and ignore them.
In order to efficiently merge the meshes of the original part and it's corresponding vacuum region, an rTree data structure has been used. The nodes of the vacuum mesh are added to the rTree. Then, when combining with the original parts, we can efficiently find duplicate nodes and ignore them.