Computing minimum length paths of a given homotopy class

This publication has 24 references indexed in Scilit:

• Triangulating a simple polygon in linear time
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• An efficient algorith for determining the convex hull of a finite planar set
  Published by Elsevier ,2002
• Computing the visibility polygon from a convex set and related problems
  Journal of Algorithms, 1991
• Translating polygons with applications to hidden surface removal
  Published by Springer Nature ,1990
• Finding minimal convex nested polygons
  Information and Computation, 1989
• Rectilinear shortest paths in the presence of rectangular barriers
  Discrete & Computational Geometry, 1989
• An output sensitive algorithm for computing visibility graphs
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1987
• Rectilinear shortest paths through polygonal obstacles in O(n(logn)²) time
  Published by Association for Computing Machinery (ACM) ,1987
• A theorem on polygon cutting with applications
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1982
• An Introduction to the Geometry of Numbers
  Published by Springer Nature ,1959