CGAL users discussion list

["Thomas Zangl - Home" <>]

Am Wed, 10 Oct 2007 17:58:45 +0200, schrieb "Sylvain Pion" 
<>:

Hi!

>One way to fix that would be to use a pseudo random generator which
>can be made deterministic.  But for debugging, it might be enough
>to just derandomize the point location, by using the "i=0" instead of
>the random number generator in the following code block from
><CGAL/Triangulaiton_3.h> :
>
>         // For the remembering stochastic walk,
>         // we need to start trying with a random index :
>         int i = rng.template get_bits<2>();
>         // For the remembering visibility walk (Delaunay only), we don't :
>         // int i = 0;

Thank you Sylvain, that made it working. I now have the same order on
different runs :-) That makes debugging a lot easier....

Best regards,
-- 
----------------------------------------------------------------
,yours Thomas Zangl, Bakk.rer.soc.oec. - 

 -
- Freelancer - IT Consulting & Software Development -
- Student of Software Development-Economy (Master) -