Fastest horizontal line <-> convex polygon intersection algorithm?
Hi, I need to solve a relatively simple thing -- I've got n-vertices convex 2D polygon and a horizontal (!) line with some 'y' coordinate. I need only one thing: to check if the polygon is crossed with this line (i.e. have 2 intersections) or not. The fastest one I can think of is to find min/max y coordinates within a polygon (loop re...