--- Den lør 1/5/10 skrev Henry Rich <[email protected]>: > Since his polygons are convex, surely a more efficient > solution would be to use the log n method.
For polygons with few vertices the containment problem is fast anyways. If n is small a O(log n) method need not be faster than a O(n) method. Polygons with many vertices are not likely to be convex. Response times of milliseconds are acceptable, and even a tenfold speedup is commercially unimportant. Responce times of years are unacceptable, and even a tenfold speedup doesn't help it. Chasing percentages is uninteresting except for the fun of it. So a simple and general program that is performing acceptably fast is satisfactory. - Bo ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
