Triangulating a simple polygon in linear time
Discrete & Computational Geometry
An Optimal Algorithm for Euclidean Shortest Paths in the Plane
SIAM Journal on Computing
Introduction to Algorithms, Third Edition
Introduction to Algorithms, Third Edition
Conformal Mapping in Linear Time
Discrete & Computational Geometry
Continuous nearest-neighbor search in the presence of obstacles
ACM Transactions on Database Systems (TODS)
Computing shortest paths amid pseudodisks
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Shortest path in a multiply-connected domain having curved boundaries
Computer-Aided Design
A near-optimal algorithm for shortest paths among curved obstacles in the plane
Proceedings of the twenty-ninth annual symposium on Computational geometry
Computing shortest paths among curved obstacles in the plane
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |
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.