License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SoCG.2017.64
URN: urn:nbn:de:0030-drops-72417
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/7241/
Go to the corresponding LIPIcs Volume Portal

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

Folding Free-Space Diagrams: Computing the Fréchet Distance between 1-Dimensional Curves (Multimedia Contribution)

pdf-format:
LIPIcs-SoCG-2017-64.pdf (0.4 MB)

Abstract

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

BibTeX - Entry

@InProceedings{buchin_et_al:LIPIcs:2017:7241,
  author =	{Kevin Buchin and Jinhee Chun and Maarten L{\"o}ffler and Aleksandar Markovic and Wouter Meulemans and Yoshio Okamoto and Taichi Shiitada},
  title =	{{Folding Free-Space Diagrams: Computing the Fr{\'e}chet Distance between 1-Dimensional Curves (Multimedia Contribution)}},
  booktitle =	{33rd International Symposium on Computational Geometry (SoCG 2017)},
  pages =	{64:1--64:5},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-038-5},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{77},
  editor =	{Boris Aronov and Matthew J. Katz},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7241},
  URN =		{urn:nbn:de:0030-drops-72417},
  doi =		{10.4230/LIPIcs.SoCG.2017.64},
  annote =	{Keywords: Frechet distance, ply, k-packed curves}
}

Keywords: Frechet distance, ply, k-packed curves
Collection: 33rd International Symposium on Computational Geometry (SoCG 2017)
Issue Date: 2017
Date of publication: 20.06.2017

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI