CGAL users discussion list

I am running an application in which a polygon with holes gets divided into 
two parts, and I have to determine which holes go to which side. This can be 
done by checking if a point on the hole is within one of the halfs or 
another. 

However, doing so with CGAL::bounded_side for each point will probably take 
me O(n^2) for all holes (provided that there can be n holes). Is there a way 
to do one check for all the points at once, using CGAL? (which will take O(n))

Amir.