On Mon, Aug 23, 2004 at 02:15:47PM -0400, harry eaton wrote: > > 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.
Oh shit and I feared something like getting exponential time complexity with the number of other lines or vertices or womething like that when the warning was so explicit ;-) Cl<
