@InProceedings{wang:LIPIcs.SoCG.2019.59,
  author =	{Wang, Haitao},
  title =	{{A Divide-and-Conquer Algorithm for Two-Point L\underline1 Shortest Path Queries in Polygonal Domains}},
  booktitle =	{35th International Symposium on Computational Geometry (SoCG 2019)},
  pages =	{59:1--59:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-104-7},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{129},
  editor =	{Barequet, Gill and Wang, Yusu},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.59},
  URN =		{urn:nbn:de:0030-drops-104631},
  doi =		{10.4230/LIPIcs.SoCG.2019.59},
  annote =	{Keywords: shortest paths, two-point queries, L\underline1 metric, polygonal domains}
}