Efficient algorithms for Euclidean shortest path and visibility problems with polygonal obstacles

@inproceedings{Kapoor1988EfficientAF,
  title={Efficient algorithms for Euclidean shortest path and visibility problems with polygonal obstacles},
  author={S. Kapoor and S. Maheshwari},
  booktitle={SCG '88},
  year={1988}
}
  • S. Kapoor, S. Maheshwari
  • Published in SCG '88 1988
  • Mathematics, Computer Science
  • The problem of determining the Euclidean shortest path between two points in the presence of m simple polygonal obstacles is studied. An O( m<supscrpt>2</supscrpt> logn + nlogn ) algorithm is developed, where n is the total number of points in the obstacles. A simple O(E+T) algorithm for determining the visibility graph is also shown, where E is the number of visibility edges and T is the time for triangulating the point set. This is extended to a O(E<subscrpt>s</subscrpt> + nlogn) algorithm… CONTINUE READING
    80 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
    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
    Planar rectilinear shortest path computation using corridors
    • 23
    • PDF
    Minimum-link paths among obstacles in the plane
    • 32
    • PDF
    L1 shortest paths among polygonal obstacles in the plane
    • J. Mitchell
    • Mathematics, Computer Science
    • Algorithmica
    • 2005
    • 107
    Computing Shortest Paths among Curved Obstacles in the Plane
    • 14
    Shortest paths among obstacles in the plane
    • 152