[algogeeks] geometry

Given a set of points, find the line that intersects the most number of points -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to alg

[algogeeks] Geometry Problem.

Hi. We have a line and a convex polygon with n vertex.we want to find 2 intersection point of line with polygon in O(lgN). how can we do that? Thanks in advance. --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups "Algo

[algogeeks] geometry algorithm

Dear all, I have a problem and I don't know how to solve it: I have 2 concave polygons and I need a way to match them so that the surrounding rectangle is minimal (has a minimal surface). Are there any fast algorithms for this problem? What about the case when the polygons are convex? Thanks,

[algogeeks] Geometry problems

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