Abstract
Given obstacles and crossing areas together with two pairs of terminals on the plane, our algorithm finds a pair of rectilinear paths which connect the pairs of terminals, neither pass through any obstacle nor cross each other except in the crosssing areas, and minimize the total length, where all obstacles and crossing areas are assumed to be axis-parallel rectangles. The algorithm takes O(n log n) time and O(n) space, where n is the total number of obstacles and crossing areas.
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 callMore From: International Journal of Computational Geometry & Applications
Disclaimer: 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.
