Consider a simple polygon P over vertices, on the plane, and a point s, which maybe inside or outside P. Design an O(nlogn) algorithm that finds a line segment starting from, and cutting a maximum number of edges of P. An edge of P is any one of the line segments making up its boundary. (Note that if your segment passes through a vertex of P, it is considered as one cut.)
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
