# Improved Dynamic Geodesic Nearest Neighbor Searching in a Simple Polgyon

Proc. 34th Annual Symposium on Computational Geometry, 2018

@inproceedings{dyn_geod_nn2018, author = {Agarwal, Pankaj K. and Arge, Lars and Staals, Frank}, title = {Improved Dynamic Geodesic Nearest Neighbor Searching in a Simple Polgyon}, booktitle = {Proc. 34th Annual Symposium on Computational Geometry}, year = {2018}, editor = {Bettina Speckmann and Csaba D. T{\'o}th}, location = {Budapest, Hungary}, numpages = {14}, keywords = {data structure, simple polygon, geodesic distance , nearest neighbor searching, shallow cutting}, category = {datastructures}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, pages = {4:1--4:14}, isbn = {978-3-95977-066-8}, issn = {1868-8969}, volume = {99}, url = {https://doi.org/10.4230/LIPIcs.SoCG.2018.4}, doi = {10.4230/LIPIcs.SoCG.2018.4}, }