> And what if I had 1,000 point convex polygon with 2,000 lines inside it's > bounding box, none of which touched it -- how many comparisons would it > roughly take?
It would be exactly the same, but it's less common that convex polygons have as many non-intersecting lines. A simple rectangle is the only case that's guaranteed to be trivial. But for real-world applications this really doesn't matter. h.
