I'm in the process of integrating an OCR engine into our product line,
and one of the peculiarities it has is that if you specify two text
regions on a page, where one overlaps the other, then the one "on top"
will get the text from that area, but the one "under" it will not. If
this weren't an ASCII posting, a diagram would make it much easier to
describe, but alas.....
In my code, I need to know if any rectangular region in my list
overlaps with any other region. Does anyone have a suggestion about
how to determine this, other than a brute-force point-in-a-polygon
test, for each vertex against each rectangle, which requires 4 *
((n^2)/2) tests? Yuk.
Thanks for any hints.
Dave Bushong, Wang Laboratories, Inc.