CGAL users discussion list

[Sebastien Loriot <>]

Without seeing any code it is hard to tell. Are you using do_intersect 
or intersection?

Best,

Sebastien.

On 5/4/21 9:01 AM, jana jelenki ( via cgal-discuss Mailing 
List) wrote:
> Hi,
> I find this topic very interesting. I already use spatial partitioning 
> and also OpenMP. For an average Triangle_3 Triangle_3 intersection my 
> program needs on average 0.1ms in release mode. I also use the exact 
> kernel. Is this the limit of the CGLAL implementation, are there any 
> numbers or benchmarks?  Or can you squeeze there even further?
> Best
>
>     Вторник, 4 мая 2021, 6:35 +03:00 от Andrew Cunningham
>     <>:
>     Hi Anish,
>     Since your code is a N^2 algorithm , it's not surprising that this is
>     taking a long time. The first thing that comes to mind is to bound
>     each triangle with a CGAL AABB (BoundingBox) and use CGAL AABB
>     algorithms to find the pairs of intersecting bounding boxes(pairs of
>     potential triangle intersections). That would make a huge difference
>     in execution time.
>     And once you have done that, you could loop over the intersecting
>     pairs and use OpenMP or other threading approaches like TBB to process
>     the intersecting pairs in parallel. I personally have had great
>     success with OpenMP tasks and CGAL.
>
>     Andrew
>
>     On Mon, May 3, 2021 at 1:17 PM Rasal Raj, Anish
>     <
>     </compose?To=anish.rasal@rwth%2daachen.de>> wrote:
>      >
>      > Hello Guys,
>      >
>      > I have recently started working with CGAL. I have a doubt.
>      >
>      >
>      > I am using CGAL intersection operation on a list of triangles.
>     currently, it takes some time to complete the information. What are
>     the possible ways to improve the execution time?
>      >
>      >
>      > Note: the list of triangles contains around 25k triangles. I have
>     attached a sample code with this e-mail. I am using
>     Exact_predicates_exact_constructions_kernel kernel.
>      >
>      >
>      > --
>      > You are currently subscribed to cgal-discuss.
>      > To unsubscribe or access the archives, go to
>      > https://sympa.inria.fr/sympa/info/cgal-discuss
>     <https://sympa.inria.fr/sympa/info/cgal-discuss>
>      >
>
>     --
>     You are currently subscribed to cgal-discuss.
>     To unsubscribe or access the archives, go to
>     https://sympa.inria.fr/sympa/info/cgal-discuss
>     <https://sympa.inria.fr/sympa/info/cgal-discuss>
>
> --
> jana jelenki
>
> --
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://sympa.inria.fr/sympa/info/cgal-discuss