CGAL users discussion list

[Jayesh Salvi <>]

Hello,

In my program I am creating two polyhedrons from two meshes (In this
case a cube and a sphere). Then I convert them to Nef Polyhedra and
apply union (+) operation on them. I then convert the returned Nef
Polyhedron into a Polyhedron_3, but before doing that I run
is_simple() check (just so that if it is not simple, I can generate an
error message, instead of assertion failure crash during the
conversion process).

In this particular case - with a cube and sphere of specific
geometries - I observed that after some time the program starts
occupying a lot of memory and consumes most of the CPU. From the top
utility, I can see that the process is taking >90% memory and >90%
CPU. To see what's going on, I put cout statements at various places
to see during which part of the program does this start to happen. I
was surprised to find out that this happens when I call is_simple()
check on the nef polyhedron. At this point either I have to kill the
process or the system terminates it.

I tried to run the program through valgrind, but as I read elsewhere
valgrind can't be used with CGAL programs because of floating point
issues.

Do you have any suggestions how can I proceed to debug this?

Thanks in advance.

(My project is available at http://jayesh3.github.com/cadmium/ I can
provide instructions on how to reproduce the issue, if you need)
--
Jayesh