Computing minimum length paths of a given homotopy class
- 30 June 1994
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 4 (2) , 63-97
- https://doi.org/10.1016/0925-7721(94)90010-8
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- An Output-Sensitive Algorithm for Computing Visibility GraphsSIAM Journal on Computing, 1991
- Triangulating a simple polygon in linear timeDiscrete & Computational Geometry, 1991
- On rectilinear link distanceComputational Geometry, 1991
- Computing the visibility polygon from a convex set and related problemsJournal of Algorithms, 1991
- An optimal algorithm for computing a minimum nested nonconvex polygonInformation Processing Letters, 1990
- Finding minimal convex nested polygonsInformation and Computation, 1989
- Rectilinear shortest paths in the presence of rectangular barriersDiscrete & Computational Geometry, 1989
- Rectilinear shortest paths through polygonal obstacles in O(n(logn)2) timePublished by Association for Computing Machinery (ACM) ,1987
- Triangulating Simple Polygons and Equivalent ProblemsACM Transactions on Graphics, 1984
- A note on two problems in connexion with graphsNumerische Mathematik, 1959