Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n):::2:::) Time

Kenneth L. Clarkson, Sanjiv Kapoor, Pravin M. Vaidya. Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n):::2:::) Time. In Symposium on Computational Geometry. pages 251-257, 1987. [doi]

@inproceedings{ClarksonKV87,
  title = {Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n):::2:::) Time},
  author = {Kenneth L. Clarkson and Sanjiv Kapoor and Pravin M. Vaidya},
  year = {1987},
  doi = {10.1145/41958.41985},
  url = {http://doi.acm.org/10.1145/41958.41985},
  researchr = {https://researchr.org/publication/ClarksonKV87},
  cites = {0},
  citedby = {0},
  pages = {251-257},
  booktitle = {Symposium on Computational Geometry},
}