Euclidean shortest paths in the presence of rectilinear barriers

This publication has 11 references indexed in Scilit:

• Routing past unions of disjoint linear barriers
  Networks, 1983
• Plane-sweep algorithms for intersecting geometric figures
  Communications of the ACM, 1982
• Finding minimum rectilinear distance paths in the presence of barriers
  Networks, 1981
• A New Approach to Planar Point Location
  SIAM Journal on Computing, 1981
• An optimal solution to a wire-routing problem (preliminary version)
  Published by Association for Computing Machinery (ACM) ,1980
• An algorithm for planning collision-free paths among polyhedral obstacles
  Communications of the ACM, 1979
• Complexity of the mover's problem and generalizations
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1979
• Triangulating a simple polygon
  Information Processing Letters, 1978
• On finding and updating shortest paths and spanning trees
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1973
• A note on two problems in connexion with graphs
  Numerische Mathematik, 1959