An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane

@article{Kapoor1997AnEA,
  title={An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane},
  author={S. Kapoor and S. Maheshwari and J. Mitchell},
  journal={Discrete & Computational Geometry},
  year={1997},
  volume={18},
  pages={377-383}
}
  • S. Kapoor, S. Maheshwari, J. Mitchell
  • Published 1997
  • Mathematics, Computer Science
  • Discrete & Computational Geometry
  • Abstract. We give an algorithm to compute a (Euclidean) shortest path in a polygon with h holes and a total of n vertices. The algorithm uses O(n) space and requires $O(n+h^2\log n)$ time. 
    121 Citations

    Topics from this paper

    Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles
    • 24
    Planar rectilinear shortest path computation using corridors
    • 23
    • PDF
    Visiting a Polygon on the Optimal Way to a Query Point
    • 1
    • PDF
    A Nearly Optimal Algorithm for Finding L 1 Shortest Paths among Polygonal Obstacles in the Plane
    • 24
    • Highly Influenced
    • PDF
    Finding Optimal Geodesic Bridges Between Two Simple Polygons
    • PDF
    L_1 Shortest Path Queries among Polygonal Obstacles in the Plane
    • 15
    • PDF
    Shortest Path Queries in Polygonal Domains
    • 9
    • Highly Influenced
    A near optimal algorithm for finding Euclidean shortest path in polygonal domain
    • 14
    • PDF
    Approximate Euclidean Shortest Paths amid Polygonal Obstacles
    • 2
    • PDF

    References

    SHOWING 1-10 OF 31 REFERENCES
    Shortest Paths in the Plane with Convex Polygonal Obstacles
    • H. Rohnert
    • Mathematics, Computer Science
    • Inf. Process. Lett.
    • 1986
    • 140
    Efficient computation of Euclidean shortest paths in the plane
    • J. Hershberger, S. Suri
    • Mathematics, Computer Science
    • Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science
    • 1993
    • 73
    • PDF
    An Optimal Algorithm for Euclidean Shortest Paths in the Plane
    • 328
    • PDF
    Euclidean shortest paths in the presence of rectilinear barriers
    • 398
    Shortest paths in the plane with polygonal obstacles
    • 97
    • PDF
    An Output Sensitive Algorithm for Computing Visibility Graphs
    • 277
    • PDF
    An output sensitive algorithm for computing visibility graphs
    • S. Ghosh, D. Mount
    • Mathematics, Computer Science
    • 28th Annual Symposium on Foundations of Computer Science (sfcs 1987)
    • 1987
    • 192
    Shortest paths among obstacles in the plane
    • 152
    Triangulating disjoint Jordan chains
    • 57