Abstract
An algorithm is given for reporting pairs of intersecting polygons from among a given set of polygons. A plane-sweeping algorithm is used together with a segment tree of the type introduced by Bentley and Wood [2] to report intersections between rectilinearly oriented rectangles. Bentley and Wood use a segment tree to store the line segments formed by the intersection of a sweep line with the set of rectangles. When arbitrarily polygons are used instead of rectangles, the cross-sections of the polygons are of continually varying length, and the standard segment tree is not satisfactory. In order to handle this difficulty the concept of pseudo-coordinates is introduced.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
