Euclidean shortest paths in the presence of rectilinear barriers

@article{Lee1984EuclideanSP,
  title={Euclidean shortest paths in the presence of rectilinear barriers},
  author={D. Lee and F. Preparata},
  journal={Networks},
  year={1984},
  volume={14},
  pages={393-410}
}
  • D. Lee, F. Preparata
  • Published 1984
  • Mathematics, Computer Science
  • Networks
  • In this paper we address the problem of constructing a Euclidean shortest path between two specified points (source, destination) in the plane, which avoids a given set of barriers. This problem had been solved earlier for polygonal obstacles with the aid of the visibility graph. This approach however, has an Ω(n2) time lower bound, if n is the total number of vertices of the obstacles. Our goal is to find interesting cases for which the solution can be obtained without the explicit… CONTINUE READING
    398 Citations
    A new algorithm for shortest paths among obstacles in the plane
    • J. Mitchell
    • Mathematics, Computer Science
    • Annals of Mathematics and Artificial Intelligence
    • 2005
    • 52
    • PDF
    Rectilinear shortest paths in the presence of rectangular barriers
    • 79
    • PDF
    An Optimal Algorithm for Euclidean Shortest Paths in the Plane
    • 328
    • PDF
    Shortest Paths Among Obstacles in the Plane Revisited
    • PDF
    L1 shortest paths among polygonal obstacles in the plane
    • J. Mitchell
    • Mathematics, Computer Science
    • Algorithmica
    • 2005
    • 107
    RECTILINEAR SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
    • PDF
    Shortest Paths in the Plane with Obstacle Violations
    • PDF
    Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles
    • 117

    References

    SHOWING 1-10 OF 15 REFERENCES
    Finding minimum rectilinear distance paths in the presence of barriers
    • 128
    Proximity and reachability in the plane.
    • 149
    Routing past unions of disjoint linear barriers
    • 5
    Plane-sweep algorithms for intersecting geometric figures
    • 270
    • PDF
    A New Approach to Planar Point Location
    • F. Preparata
    • Mathematics, Computer Science
    • SIAM J. Comput.
    • 1981
    • 133
    • PDF
    Optimal Search in Planar Subdivisions
    • 763
    • PDF
    A note on two problems in connexion with graphs
    • E. Dijkstra
    • Mathematics, Computer Science
    • Numerische Mathematik
    • 1959
    • 19,619
    • PDF
    An Optimal Solution to a Wire-Routing Problem
    • M. Tompa
    • Mathematics, Computer Science
    • J. Comput. Syst. Sci.
    • 1981
    • 64
    Complexity of the mover's problem and generalizations
    • J. Reif
    • Computer Science
    • 20th Annual Symposium on Foundations of Computer Science (sfcs 1979)
    • 1979
    • 882
    • PDF