Abstract
This submission is a communication related to a recently published article in Computer-Aided Design journal, titled “Shortest path in a multiply-connected domain having curved boundaries”. We point out an error in estimating the time complexity of the algorithm proposed in that paper, using a simple example. We also illustrate, with a different example, that an ostensibly time-saving scheme used by that algorithm, called exterior region elimination, cannot be applied in general to derive the correct shortest interior path. Finally, we propose an alternate algorithm that solves the same problem with an improved worst-case running time.
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.
