CGAL users discussion list

[Sebastien Loriot <>]

Your issue is probably different. It comes from the lazy kernel that is 
not well suited for cascaded operations.

We have started to write a new kernel that could overcome that here:
https://github.com/CGAL/cgal/pull/4495

but we have been missing time to finish. We will try to give it another
shot and see if we can finish it this time.

Best,

Sebastien.

On 3/19/24 11:00, Nicklas SB Karlsson wrote:
> Also have performance problem but for me it is with 2D polygons. Not sure 
> what take a lot execution but might be because
> of plenty of allocation and de allocation of memory.
>
> Nicklas Karlsson
>
>
> mån 2024-03-18 klockan 21:58 +0100 skrev Biye Yang:
> > Hi, all:
> >
> > I want to compute the interactions between lots of 3D polyhedrons using CGAL. 
> > It becomes low efficient when facing
> > hundreds of objects. So I tried to parallel the code with the simple 
> > multi-thread OpenMP. But the segmentation fault
> > always occur. Here is the code of the simple case:
> >
> > #pragma omp_parallel_for
> >  for(int i=0; i<Object.size(); i++)
> > {
> >       CGSurfaceMesh smesh_insect;
> >       bool valid_intersect = 
> > CGAL::Polygon_mesh_processing::corefine_and_compute_intersection(Object[i],
> > TargertObject, smesh_insect);
> > }
> >
> > I don't know how to figure that out. And do you have any suggestions on 
> > improving efficiency when handling hundreds of
> > 3D intersections using CGAL?
> > Thanks a lot!
> >
> > Best wishes,
> > Daye
> >
> > --
> > You are currently subscribed to cgal-discuss.
> > To unsubscribe or access the archives, go to
> > https://sympa.inria.fr/sympa/info/cgal-discuss