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 language | English |
|---|---|
| Title of host publication | 33rd International Symposium on Computational Geometry, SoCG 2017 |
| Editors | Matthew J. Katz, Boris Aronov |
| Publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
| Pages | 641-645 |
| Number of pages | 5 |
| ISBN (Electronic) | 9783959770385 |
| DOIs | |
| Publication status | Published - 2017 Jun 1 |
| Event | 33rd International Symposium on Computational Geometry, SoCG 2017 - Brisbane, Australia Duration: 2017 Jul 4 → 2017 Jul 7 |
Publication series
| Name | Leibniz International Proceedings in Informatics, LIPIcs |
|---|---|
| Volume | 77 |
| ISSN (Print) | 1868-8969 |
Other
| Other | 33rd International Symposium on Computational Geometry, SoCG 2017 |
|---|---|
| Country | Australia |
| City | Brisbane |
| Period | 17/7/4 → 17/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