Actually I implemented predicate that gives ability to compute exact diagram in case of voronoi of points. However I removed it from the implementation because it slowed down algorithm seriously and required additional memory usage. In case of voronoi of segments there might be up to 9 new predicates required. Of course they will slow down algorithm seriously and increase memory consumption. On Thu, Oct 28, 2010 at 2:41 AM, Thomas Klimpel <Thomas.Klimpel@synopsys.com
wrote:
Andrii Sydorchuk wrote:
The test configuration includes tests with 1 000 000 input points. This was helpful to figure out some longrun bugs. Probably you should run those tests with release option.
Ah yes, benchmarking the debug version is a certainly not a good idea.
I was less successful on win32. I somehow didn't manage to configure qt as to be able to build the example program.
I've updated build script, you shouldn't have any troubles now.
Great, it works for me now. However, I have to admit that my own mistake was much simpler: I added the line "using qt : /Qt/4.7.0 ;" to the "wrong" user-config.jam file. But I checked that your fix is really required.
Did you use mingw or cygwin to compile it? I am using msvc 9.0 compiler on win32 and it works fine. However I received the same message using cygwin + gcc.
You're right, this was cygwin + gcc. I wasn't patient enough to wait for the results with MSVC-9 (as you mentioned before, the std debug checks can slow things down considerably, and MSVC-9 really takes these debug checks serious), but later forgot that I was using cygwin.
Regards, Thomas _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
-- Best regards, Andrii Sydorchuk