Shortest Path in a Polygon using Sublinear Space

Sariel Har-Peled. Shortest Path in a Polygon using Sublinear Space. In Lars Arge, János Pach, editors, 31st International Symposium on Computational Geometry, SoCG 2015, June 22-25, 2015, Eindhoven, The Netherlands. Volume 34 of LIPIcs, pages 111-125, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015. [doi]

@inproceedings{Har-Peled15,
  title = {Shortest Path in a Polygon using Sublinear Space},
  author = {Sariel Har-Peled},
  year = {2015},
  doi = {10.4230/LIPIcs.SOCG.2015.111},
  url = {http://dx.doi.org/10.4230/LIPIcs.SOCG.2015.111},
  researchr = {https://researchr.org/publication/Har-Peled15},
  cites = {0},
  citedby = {0},
  pages = {111-125},
  booktitle = {31st International Symposium on Computational Geometry, SoCG 2015, June 22-25, 2015, Eindhoven, The Netherlands},
  editor = {Lars Arge and János Pach},
  volume = {34},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-939897-83-5},
}