A Near-Linear Time Exact Algorithm for the L₁-Geodesic Fréchet Distance Between Two Curves on the Boundary of a Simple Polygon

Thijs van der Horst, Marc J. van Kreveld, Tim Ophelders, Bettina Speckmann. A Near-Linear Time Exact Algorithm for the L₁-Geodesic Fréchet Distance Between Two Curves on the Boundary of a Simple Polygon. In Pat Morin, Eunjin Oh 0001, editors, 19th International Symposium on Algorithms and Data Structures, WADS 2025, August 11-15, 2025, York University, Toronto, Canada. Volume 349 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. [doi]

@inproceedings{HorstKOS25,
  title = {A Near-Linear Time Exact Algorithm for the L₁-Geodesic Fréchet Distance Between Two Curves on the Boundary of a Simple Polygon},
  author = {Thijs van der Horst and Marc J. van Kreveld and Tim Ophelders and Bettina Speckmann},
  year = {2025},
  doi = {10.4230/LIPIcs.WADS.2025.37},
  url = {https://doi.org/10.4230/LIPIcs.WADS.2025.37},
  researchr = {https://researchr.org/publication/HorstKOS25},
  cites = {0},
  citedby = {0},
  booktitle = {19th International Symposium on Algorithms and Data Structures, WADS 2025, August 11-15, 2025, York University, Toronto, Canada},
  editor = {Pat Morin and Eunjin Oh 0001},
  volume = {349},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  isbn = {978-3-95977-398-0},
}