Abstract
We present a new algorithm for finding minimum-link rectilinear paths among h rectilinear obstacles with a total of n vertices in the plane. After the plane is triangulated, for any point s, our algorithm builds an O(n)-size data structure in \(O(n+h\log h)\) time, such that given any query point t, we can compute a minimum-link rectilinear path from s to t in \(O(\log n+k)\) time, where k is the number of edges of the path, and the query time is \(O(\log n)\) if we only want to know the value k. The previously best algorithm solves the problem in \(O(n\log n)\) time.
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.
