Hello, I wish to use the "intersects or overlaps" geometric operator between a path and a polygon. My questions are: 1) How hard would this be to add to the system? 2) What would it take to get the R-tree indexing system to be be used to speed up queries involving such an operator? Thanks. Gautam H. Thaker Distributed Processing Lab; Lockheed Martin Adv. Tech. Labs A&E 3W; 1 Federal Street; Camden, NJ 08102 609-338-3907, fax 609-338-4144 email: [EMAIL PROTECTED]
