[Boost-users] [Polygon] Boolean (Clipping) performance

Subject: [Boost-users] [Polygon] Boolean (Clipping) performance
From: kusogray (kusogray_at_[hidden])
Date: 2012-12-23 01:45:35

Hi there, 
I input 200,000 to both polygon set A and B, with each polygon contains 5~8
points

then do the A^B;

however, this instruction cost about *30 minutes.*

my question is: 

I thought the O(n logn) algorithm with n ~ 1,000,000 just cost about at most
2 or 3 mins

I checked the XOR AND OR result is correct, but the performance is weird,

did I do anything wrong or misunderstanding?  

Thanks for reading this!
 

--
View this message in context: http://boost.2283326.n4.nabble.com/Polygon-Boolean-Clipping-performance-tp4640497.html
Sent from the Boost - Users mailing list archive at Nabble.com.