Optimal Algorithm for Geodesic Nearest-point Voronoi Diagrams in Simple Polygons

Eunjin Oh 0003. Optimal Algorithm for Geodesic Nearest-point Voronoi Diagrams in Simple Polygons. In Timothy M. Chan, editor, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019. pages 391-409, SIAM, 2019. [doi]

@inproceedings{Oh19,
  title = {Optimal Algorithm for Geodesic Nearest-point Voronoi Diagrams in Simple Polygons},
  author = {Eunjin Oh 0003},
  year = {2019},
  doi = {10.1137/1.9781611975482.25},
  url = {https://doi.org/10.1137/1.9781611975482.25},
  researchr = {https://researchr.org/publication/Oh19},
  cites = {0},
  citedby = {0},
  pages = {391-409},
  booktitle = {Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019},
  editor = {Timothy M. Chan},
  publisher = {SIAM},
  isbn = {978-1-61197-548-2},
}