[algogeeks] Geometry problems

[pramod]

1) Design a O (n^2 log(n) ) algorithm to find if any three points in a
set of n points in a plane are collinear
2) Design a O(n log(n) ) algorithm to check if two simple polygons
intersect