Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{wang:LIPIcs:2019:10463, author = {Haitao Wang}, title = {{A DivideandConquer Algorithm for TwoPoint L_1 Shortest Path Queries in Polygonal Domains}}, booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)}, pages = {59:159:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771047}, ISSN = {18688969}, year = {2019}, volume = {129}, editor = {Gill Barequet and Yusu Wang}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10463}, URN = {urn:nbn:de:0030drops104631}, doi = {10.4230/LIPIcs.SoCG.2019.59}, annote = {Keywords: shortest paths, twopoint queries, L_1 metric, polygonal domains} }
Keywords:  shortest paths, twopoint queries, L_1 metric, polygonal domains  
Collection:  35th International Symposium on Computational Geometry (SoCG 2019)  
Issue Date:  2019  
Date of publication:  11.06.2019 