Folding free-space diagrams: Computing the Fréchet distance between 1-dimensional curves

Kevin Buchin, Jinhee Chun, Maarten Löffler, Aleksandar Markovic, Wouter Meulemans, Yoshio Okamoto, Taichi Shiitada

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

By folding the free-space diagram for efficient preprocessing, we show that the Fréchet distance between 1D curves can be computed in O(nk log n) time, assuming one curve has ply k.

Original languageEnglish
Title of host publication33rd International Symposium on Computational Geometry, SoCG 2017
EditorsMatthew J. Katz, Boris Aronov
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages641-645
Number of pages5
ISBN (Electronic)9783959770385
DOIs
Publication statusPublished - 2017 Jun 1
Event33rd International Symposium on Computational Geometry, SoCG 2017 - Brisbane, Australia
Duration: 2017 Jul 42017 Jul 7

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume77
ISSN (Print)1868-8969

Other

Other33rd International Symposium on Computational Geometry, SoCG 2017
CountryAustralia
CityBrisbane
Period17/7/417/7/7

Keywords

  • Fréchet distance
  • K-packed curves
  • Ply

ASJC Scopus subject areas

  • Software

Cite this

Buchin, K., Chun, J., Löffler, M., Markovic, A., Meulemans, W., Okamoto, Y., & Shiitada, T. (2017). Folding free-space diagrams: Computing the Fréchet distance between 1-dimensional curves. In M. J. Katz, & B. Aronov (Eds.), 33rd International Symposium on Computational Geometry, SoCG 2017 (pp. 641-645). (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 77). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2017.64