Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Q&A for work
Connect and share knowledge within a single location that is structured and easy to search.
Given two cuboids in 3D space (8 vertex coordinates each) that are arbitrarily oriented, how can we find the volume of overlap between them in the fastest manner?
You can use CGAL's half_space_intersection_3 or half_space_intersection_with_construction_3 functions, where the half-spaces are defined by the faces of the cuboids.
Required, but never shown