CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

Is it an option to compute the intersection of the small polys with the 
big one at once and compute the volume independently?
Note that this will be possible if the small polys do not intersect each 
other.

Sebastien.

On 10/17/19 8:49 AM, EgorU wrote:
> Hi Sebastien,
>
> Thank you a lot for your quick response.
> I'm beginner in cgal.
> I'll clarify my issue.
>
> I have one big polyhedron_3 (> 1000 vertexes or more)
> and many different small polyhedron_3's  (like cube or brick, about 10
> vertex )
>
> I want to estimate a volume of intersection between big and one of small
> polyhedron fast (ideally not more than 4-10 ms).
>
> I don't need too much accuracy, only relative rating.
> I saw this class
> https://doc.cgal.org/latest/Polygon_mesh_processing/classCGAL_1_1Side__of__triangle__mesh.html.
> But how do you propose using it? I mean, I can to check where is point
> relative to the body, but if I will sort through a large number of points, I
> think it will not be very effective.
>
>
>
>
> --
> Sent from: http://cgal-discuss.949826.n4.nabble.com/