title: Asymptotically optimal algorithm to compute if a line intersects a convex polygon
body: <p>An O(n) algorithm to detect if a line intersects a convex polygon consists in checking if any edge of the polygon intersects the line, and look if the number of intersections is odd or even.</p>
  
  <p>Is there an asymptotically faster algorithm, e.g. an O(log n) one?</p>