CGAL users discussion list

[<>]

This is a follow up on the inquiry I placed about a month ago on the
performance of CGAL's Nef_Polyhedron with boolean operations.

I have found and evaluated another GPL library that specializes in boolean
operations on Polyhedra. This library (CARVE) performed on average 100 (ONE
HUNDRED) times faster than CGAL with the typical use-cases that apply to our
application. It also proved completely computationably stable with our tests.

In our case CARVE makes it possible to successfully comlete the project.


Best regards,
Martein