Algorithms for routing and testing routability of planar VLSI layouts
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
On continuous Homotopic one layer routing
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Cutting hyperplanes for divide-and-conquer
Discrete & Computational Geometry
Computing minimum length paths of a given homotopy class
Computational Geometry: Theory and Applications
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Testing Homotopy for paths in the plane
Proceedings of the eighteenth annual symposium on Computational geometry
Computing Minimum-Link Path in a Homotopy Class amidst Semi-Algebraic Obstacles in the Plane
AAECC-12 Proceedings of the 12th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Computing Homotopic Shortest Paths Efficiently
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Walking your dog in the woods in polynomial time
Proceedings of the twenty-fourth annual symposium on Computational geometry
Testing contractibility in planar rips complexes
Proceedings of the twenty-fourth annual symposium on Computational geometry
Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
We address the problem of computing homotopic shortest paths in presence of obstacles in the plane. The problems on homotopy of the paths received attention very recently [3, 8]. We present two output-sensitive algorithms, for simple paths and non-simple paths. The algorithm for simple paths improves the previous algorithm [8]. The algorithm for non-simple paths achieves O(log2 n) time per output vertex which is an improvement by a factor of O(n/log2 n) of the previous algorithm [13] where n is the number of obstacles.