Look out for Bentley Ottman Sweep line algorithm to determine all intersection points of set of line segments. The worst case running time is O(N^2 lg N) since max no of intersection points is O(N^2). But since we need to determine only one intersection, we can modify the algorithm to determine if two simple polygons intersect.
~Vishal
--
Vishal Padwal
-----------------------------------
Master of Science
Computer Science Dept.
Stony Brook University
Stony Brook, NY
Tel : 631-645-1406
